[20250823] BOJ / G5 / 그래프 탐색 / 권혁준 #726
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/14217
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
정점 N개 간선 M개인 그래프가 주어진다.
여기에 간선을 추가/삭제하는 작업이 Q번 주어지면, 1번 점에서 다른 모든 점까지의 최단 거리를 구해보자.
🔍 풀이 방법
인접 행렬로 그래프 구성하고, 간선을 직접 추가/삭제해서 매번 BFS를 돌려줬다.
⏳ 회고
간선 가중치를 계속 잘못 둬서 틀렸음