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/17396
🧭 풀이 시간
15분
👀 체감 난이도
✏️ 문제 설명
0에서 시작하여 보이지 않는 노드만 거쳐서N-1에 도달하고자 할 때 최단거리🔍 풀이 방법
다익스트라
다음 노드 방문처리 할 때 다음 노드가
N-1이 아니면서 보이지 않는지 여부 확인하고 방문처리 하면 됨⏳ 회고
보이는 노드
dist를 0으로 만들어버리는거 신선하다