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분
👀 체감 난이도
✏️ 문제 설명
임의의
K개 간선의 가중치를 0으로 만들 수 있을 때1부터N까지의 최단거리를 구하시오🔍 풀이 방법
다익스트라 + dp
dist를 2차원으로 두어서 간선을j번 0으로 만들었을 때의 최단거리 저장1과N을 연결하는 간선의 갯수가K가 되지 않을 수 있기 때문에 무조건K번 다 사용한다고 최단거리가 보장되는 것이 아님→ 이 경우
dist[N][간선 수]에 0이 저장되고 그 이후로는INF가 저장됨⏳ 회고
가중치가 long인지 여부를 꼭 확인하자^^