[20250720] BOJ / G4 / 여행가자 / 이준희 #506
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/1976
🧭 풀이 시간
20분
👀 체감 난이도
✏️ 문제 설명
도시와 각 도시끼리의 연결여부가 주어졌을 때
주어지는 도시의 순서대로 여행을 할 수 있을지 여부를 판단하는 문제입니다,
🔍 풀이 방법
시간이 2초로 여유가 있어서 쉽게 플로이드-워셜을 사용해서 풀었습니다.
문제의 데이터로 주어지는 도시끼리의 연결 여부에서 자기자신 끼리는 연결되어 있지 않다고 표현되어 있어 이 부분의 함정을 찾는데 시간이 조금 소요되었습니다.
⏳ 회고
특이 케이스를 잘 생각해봐야될 것 같스빈다.