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
🧭 풀이 시간
50분
👀 체감 난이도
✏️ 문제 설명
수빈이가 동생의 위치까지 도달하는 가장 빠른 시각을 구하라.
수빈이의 위치가 x일 때, 아래 방식으로 이동할 수 있다.
🔍 풀이 방법
다익스트라로 풀어야 하나 했는데 가중치가 0과 1뿐이면 0-1 BFS를 쓰는 게 훨 빠르다고 알고 있어서 그거 썼다.
deque 써서 0초 걸리는 경우는 addFirst하고 1초 걸리는 경우는 addLast 하면 된다.
⏳ 회고