[20250824] BOJ / G4 / 끝나지 않는 파티 / 김수연 #733
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/11265
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
한 파티장에서 다른 파티장까지 시간내에 도착할 수 있는지 없는지 구하기
🔍 풀이 방법
플로이드-워셜 이용
각 파티장에 갈 수 있는 최소 시간을 구하고, 해당 값을 기준으로 도착여부 출력
⏳ 회고
플로이드워셜 마스터