[20260313] BOJ / G4 / 행성 연결 / 이준희#2019
Merged
ShinHeeEul merged 1 commit intomainfrom Mar 13, 2026
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
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/16398
🧭 풀이 시간
40분
👀 체감 난이도
✏️ 문제 설명
홍익제국에서 각 행성들을 효과적으로 통치하기 위해 연결시키려고 합니다.
각 행성을 연결 시키기 위한 값들이 주어졌을 때
모든 행성을 연결 시킬 수 있는 최소값을 구하는 문제입니다
🔍 풀이 방법
union find를 이용한 크루스칼 알고리즘을 이용했습니다.
n값을 고려하여 long 자료형으로 오버플로우 방지 했습니다.
⏳ 회고
문제를 읽자마자 풀이방법을 떠올릴 수 있을만한 쉬운 문제였습니다