[20250813] BOJ / G5 / 상범 빌딩 / 김수연 #656
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/6593
🧭 풀이 시간
20분
👀 체감 난이도
✏️ 문제 설명
상범 빌딩은 정육면체로 이루어져서 인접한 6개의 칸 (동, 서, 남, 북, 상, 하)로 이동할 수 있다.
시작점과 끝점이 주어질 때, 상범 빌딩을 탈출할 수 있는 최단 시간 구하기
🔍 풀이 방법
bfs 사용했다.
근데 3차원 배열 bfs여서 조금 특이했지만 일반적인 bfs임
⏳ 회고
bfs 마스터 김수연의 빌딩 마련기