[20251201] BOJ / G5 / 최소비용 구하기 / 강신지 #1560
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/1916
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
N개의 도시가 있고 M개의 버스가 있다.
각 버스는 출발 도시, 도착 도시, 비용으로 표현되며 방향성이 존재한다.
A번째 도시에서 B번째 도시까지 가는데 드는 버스 비용의 최솟값을 구하라.
🔍 풀이 방법
비용이 모두 양수이므로 다익스트라로 풀었다
⏳ 회고
다익스트라 기본 문제였다.