[20251113] BOJ / G1 / 달이 차오른다, 가자 / 이준희#1393
Merged
ShinHeeEul merged 1 commit intomainfrom Nov 13, 2025
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
2 participants
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/1194
🧭 풀이 시간
60분
👀 체감 난이도
✏️ 문제 설명
통로, 벽, 열쇠, 문이 있는 지도에서 시작점에서 목적지까지 가는 최소 거리를 구하는 문제입니다.
문은 6종류가 있으며 이에 대응하는 열쇠도 6종류가 있고 각 경우마다 문을 열 열쇠가 존재하지 않을 수도 있습니다.
🔍 풀이 방법
bfs를 이용해서 풀었습니다.
일반적인 bfs에 visited 배열을 3차원으로 두어서 열쇠를 얻었을 경우 해당 열쇠 비트를 사용해서 사실상 visited가 초기화되는 그런 식으로 풀었습니다.
⏳ 회고
비트를 사용하는 방식을 떠올리기가 쉽지 않았던 것 같습니다