[20250806] BOJ / G5 / 여러분의 다리가 되어 드리겠습니다! / 김수연 #618
Merged
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/17352
🧭 풀이 시간
20분
👀 체감 난이도
✏️ 문제 설명
모든 섬을 잇는 다리 N-1개가 있었는데, 하나가 무너짐
서로 다른 두 섬을 다리로 이어서 다시 어떤 두 섬 사이든 왕복할 수 있도록 하는 두 섬의 번호 출력
🔍 풀이 방법
유니온 파인드 사용해서
parents[i]와 i가 같은 섬 두개를 연결함
⏳ 회고
유니온 파인드는 안하면 자꼬 까먹는다.