[20250219] BOJ / 골드5 / 장군 / 김수연 #148
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/16509
🧭 풀이 시간
20분
👀 체감 난이도
✏️ 문제 설명
상이 왕에게 도달할 수 있는 최소 이동 횟수 구하기
🔍 풀이 방법
bfs를 이용해서 이동가능한 경로들을 다 탐색했다.
왕이 경로 중간에 있으면 이동할 수 없으므로 예외처리를 해주어야했다.
⏳ 회고
예외처리 신경쓰기