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분
👀 체감 난이도
✏️ 문제 설명
수열이 두 개 주어짐
a는 해당 인덱스에서 어디로 이동가능한지b는 이동하는데 걸리는 시간이 저장됨1 ~ N까지가 범위임임의의 인덱스에서 위 범위를 벗어나는데 걸리는 최소시간 모두 출력하기
🔍 풀이 방법
다익스트라
1 ~ N까지가 범위이니까 역으로0과N + 1부터 다익스트라 시작함N + 1까지 참조해야해서 배열 길이N + 2로 초기화 필요다익스트라 방법은 똑같은데 가중치가 정수 범위를 넘어가므로
long으로 계산해야함⏳ 회고
PriorityQueue인데ArrayDeque써놓고 왜 시간초과지 이러고 있었음