[20250827] BOJ / P5 / 도로포장 / 이강현 #754
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/1162
🧭 풀이 시간
60분
👀 체감 난이도
✏️ 문제 설명
1에서 N까지 가는데 도로 포장을 하면 비용이 0이됨.
K개만큼 도로 포장 가능. 최소 비용 출력
🔍 풀이 방법
다익스트라
dist[목적지][사용한 도로포장 개수]로 정의하고 다익스트라 적용
⏳ 회고
그냥 dist 하나 정보 추가된건데 플레5는 좀 아닌거 같긴해.