[20251018] BOJ / G4 / 가장 먼 곳 / 설진영 #1158
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/22865
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
N개의 땅 중에서 세 친구 A, B, C로부터 가장 먼 곳을 찾기
각 땅에서 가장 가까운 친구까지의 거리를 기준으로, 그 값이 최대인 땅을 선택
🔍 풀이 방법
세 친구의 위치에서 각각 다익스트라 알고리즘을 실행하여 모든 땅까지의 최단 거리 구함
각 땅마다 세 친구까지의 거리 중 최솟값 계산
그 최솟값이 가장 큰 땅을 선택
⏳ 회고
전형적인 다익스트라 응용 문제