[20250822] BOJ / G4 / 도시 건설 / 김수연 #715
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/21924
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
건물 개수 N개와 도로 개수 M개가 주어질 때,
최단 예산으로 모든 건물을 잇는 도로를 만들 때, 얼마를 절약할 수 있는지 구하기
🔍 풀이 방법
다익스트라 써서 PriorityQueue로 가장 cost가 적은 도로 선택해서 연결함
⏳ 회고
다익스트라 으릅다