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/4179
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
불이 붙은 미로에 지훈이가 갇혀있고, 불은 매 시간 4방향(상,하,좌,우)로 번지고 지훈이도 그처럼 움직일 수 있을 때
지훈이가 탈출할 수 있는 최소 시간을 구하는 문제입니다.
🔍 풀이 방법
지훈이와 불을 구분할 수 있는 타입을 갖는 노드를 이용하여 BFS를 사용했습니다.
각 타입별로 visited 배열의 3depth에 표기하여서 풀었습니다.
⏳ 회고
1학기 때 풀었던 원숭이 어쩌구 하는 문제와 똑같은 문제여서 손쉽게 풀었습니다.