Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
🧷 문제 링크
https://www.acmicpc.net/problem/16562
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
친구의 친구는 친구일 때, 준석이가 가장 비용으로 모든 사람과 친구가 되는 최소비용 구하기
🔍 풀이 방법
union-find 를 사용해서 친구비가 가장 적은 친구를 선택해서 해당 친구로 연결된 친구들의 parent를 바꿔줌
parent는 친구비가 가장 작은 친구의 index로 초기화
⏳ 회고
알고리즘..하기 실타