[20250407] BOJ / G2 / 면접보는 승범이네 / 권혁준 #301
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/17835
🧭 풀이 시간
10분
👀 체감 난이도
✏️ 문제 설명
N개의 도시와, 이들을 연결하는 단방향 도로 M개가 주어진다.
N개의 도시 중 K개의 도시에 면접장이 존재한다.
면접장까지의 거리가 가장 먼 도시를 구해보자.
🔍 풀이 방법
[사용한 알고리즘]
면접장이 배치된 도시들을 모두 시작점으로 두고 다익스트라를 수행한다.
면접장까지 도달하는 경로를 구하는 것이기 때문에, 그래프 간선은 역방향으로 바꾼다.
⏳ 회고
역방향 그래프를 떠올리는 것이 중요하다