Merged
Conversation
suyeun84
added
success 👍
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/14621
🧭 풀이 시간
60분
👀 체감 난이도
✏️ 문제 설명
남초 대학교와 여초 대학교를 최단 거리로 연결하기
🔍 풀이 방법
MST 사용 - 크루스칼 알고리즘 사용해서 가장 작은 거리인 것부터 선택해서 연결
⏳ 회고
처음에 다익스트라로 풀었는데, 방향성이 없을 때는 항상 최소는 아니더라..
방향성 없으면 최소 신장 트리 사용하기..!