[20250709] BOJ / G3 / 벽 부수고 이동하기 / 이강현 #426
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/14442
🧭 풀이 시간
40분
👀 체감 난이도
✏️ 문제 설명
1,1 부터 N,M까지 이동하는데 벽이 있고 뚫을 수 있는 기회가 K번 주어질때 최단거리 출력
🔍 풀이 방법
BFS
visited[i][j][k]로 상태 정의하고 BFS 그대로 쓰자
⏳ 회고
visited 처리를 q에서 나오고 했는데 그냥 넣을 때 해야하는 거였음.
0-1 BFS랑 좀 헷갈려 ㅠ