[20260101] BOJ / G2 / 네트워크 복구 / 김민진 #1759
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
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.
🧷 문제 링크
네트워크 복구
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
슈퍼컴퓨터와 다른 컴퓨터가 최단거리로 연결되기 위해 두어야할 간선들만 출력하기
🔍 풀이 방법
다익스트라
기본은 다익스트라인데
parents배열을 따로 둬서 최단거리가 업데이트되면 해당 간선이 어떤 노드간의 연결인지 저장함중복이 있을 수 있기 때문에 Set 사용해서 중복 거름
⏳ 회고
저번에 택배 문자랑 좀 비슷한듯??