[20250820] BOJ / G4 / 가운데에서 만나기 / 이준희 #698
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/21940
🧭 풀이 시간
25분
👀 체감 난이도
✏️ 문제 설명
마을을 있는 일방통행 길의 정보가 주어지고 각 친구들의 위치가 주어졌을 때
친구들이 한 마을에서 만났다가 헤어질 때의 비용 중 최대 비용이 최소인 마을을 구하는 문제입니다
🔍 풀이 방법
플로이드 워셜로 모든 길을 다 계산한 후 후처리 하였습니다.
⏳ 회고
사실 플로이드 워셜이 더 쉬워서 다익스트라로 안풀었는데
간선의 개수가 크기 때문에 플로이드 워셜로 잘 푼것 같습니다