[20251205] BOJ / G2 / 대운하 / 한종욱 #1587
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
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/2350
🧭 풀이 시간
50분
👀 체감 난이도
✏️ 문제 설명
N개의 도시에 M개의 운하를 건설하는데 시작과 끝을 K개 준다. K개의 경로에서 갈 수 있는 최대 배의 폭은?
🔍 풀이 방법
크루스칼로 각 노드를 모두 연결하고, BFS로 갈 수 있는 배의 최대 폭을 구한다.
⏳ 회고
MST 오랜만이라 헷갈린다.