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/13549
🧭 풀이 시간
40분
👀 체감 난이도
✏️ 문제 설명
수빈이가 동생을 찾는 최단시간을 구하는 문제
🔍 풀이 방법
BFS (Zero-One BFS) 사용
2*X (0초) → 덱 앞쪽에 추가
X-1, X+1 (1초) → 덱 뒤쪽에 추가
⏳ 회고
0-1 BFS 인거 알고 풀었음
다익스트라 쓰려 하지 말고, 이런 상황에서는 0-1 BFS를 사용해보자