[20250923] BOJ / G3 / 두 단계 최단 경로 2 / 이강현 #959
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/23801
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
X에서 Z로 가는데 Y들을 적어도 하나 거쳐서 가야함.
이때 최단 거리 출력
🔍 풀이 방법
다익스트라
X에서 다익, Z에서 다익하고 distX[Y] + distZ[Y]의 최소를 Y들중 구하면댐
⏳ 회고
다익스트라를 해야하는데 중간에서 만난다면 양끝에서 해보는 것을 생각해보자!