[20250906] BOJ / G5 / 상범 빌딩 / 이준희 #827
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
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
3차원 빌딩에 상범이와 출구가 있고, 상범이는 분당 동 서 남 북 상 하 로 이동할 수 있을 때
상범이가 탈출하는 시간을 제공되는 출력 형식에 맞게 출력하는 문제입니다.
🔍 풀이 방법
3차원 배열을 BFS를 이용하여 풀었습니다.
⏳ 회고
간단한 BFS 였습니다