[20250927] BOJ / G5 / 노드사이의 거리 / 이준희 #988
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.
🧷 문제 링크
https://www.acmicpc.net/problem/1240
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
노드의 개수와 노드 사이의 거리들이 주어졌을 때
특정 노드 a에서 b까지의 거리를 구하는 문제입니다.
🔍 풀이 방법
플로이드-워셜로 모든 노드 사이의 거리를 구한 후
노드 번호들을 받아서 시키는대로 출력했습니다.
⏳ 회고
풀고보니 문제 유형에는 플로이드-워셜이 없었는데 노드 갯수가 많았으면 아마 틀렸을 수도 있을 것 같습니다.