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/28131
🧭 풀이 시간
80분
👀 체감 난이도
✏️ 문제 설명
다익스트란데 cost가 k배수이면서 최솟값을 찾는 다익스트라
🔍 풀이 방법
dist[i][j]: i번 노드까지 가는데, 총 거리를 K로 나눈 나머지가 j인 경우의 최소 거리이 상태로 정의하고 기본 다익스트라로 dist값들을 모두 구한다.
⏳ 회고
상태 정의를 못했다. bfs의 3차원 visited같은 느낌이었는데 응용을 못했다. 더 많은 문제를 풀어야겠는데....