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.
🧷 문제 링크
미로만들기
🧭 풀이 시간
40분
👀 체감 난이도
✏️ 문제 설명
좌상단에서 우하단으로 이동할 때 부숴야하는 방의 최솟값
🔍 풀이 방법
0-1 BFS
다음 방이 흰 방이면
cnt그대로 넣고 검은 방이면cnt + 1을 넣음근데 흰 방이면 덱의 앞부분에 넣고 검은 방은 뒷부분에 넣어서
cnt가 적은 방부터 확인 가능하게⏳ 회고
냅다 BFS 돌리니까 안풀리네~..
다익스트라 + BFS 느낌