[20251031] PGM / Lv2 / 전력망을 둘로 나누기 / 이강현 #1279
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://school.programmers.co.kr/learn/courses/30/lessons/86971
🧭 풀이 시간
20분
👀 체감 난이도
✏️ 문제 설명
전력망이 트리 구조로 존재함.
특정 전선을 끊어서 전력망을 둘로 나눌때, 두 전력망 속 노드 수의 차이가 가장 적을때 그 값을 구하기.
🔍 풀이 방법
완전탐색, bfs
한번만 나누면 되고 전선이 100개미만이라
n번 자르는데 한번 자를때, 자른 지점에서 원래 연결되어있던 애를 제외하고 bfs를 돌린 후 개수를 구함.
그리고 그 개수가 최적인지 판단하는 것을 반복.
⏳ 회고
ez