Merged
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/1647
🧭 풀이 시간
40분
👀 체감 난이도
✏️ 문제 설명
마을을 두 개의 분리된 마을로 분할하려고 한다.
이때, 길 유지비의 합을 최소로 만들 때의 유지비 구하기
🔍 풀이 방법
크루스칼 이용해서 간선을 유지비가 작은 순서대로 정렬하고,
N-2개 추가하면 마을이 2개로 나눠진다.
union-find를 이용해서 경로 압축을 한다.
⏳ 회고
마을이 2개로 나눠질 때를 계속 확인해줘야된다고 생각했는데, N-2번만 돌리면 됐다..