[20260112] BOJ / G3 / 트리를 복잡하게 색칠하는 최소 비용 / 이강현 #1787
Merged
+50
−0
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/25690
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
트리의 정점을 색칠할거임.
이웃한 두 정점이 white,white 혹은 white,black이 되게끔 색칠해야하는데 정점마다 white,black 색칠하는 비용이 서로다름
조건을 만족하면서 최소비용으로 트리내 정점을 모두 색칠하는 비용을 출력하자.
🔍 풀이 방법
트리 dp
dfs로 진입하면서 색칠하기
⏳ 회고
트리 dp를 저번에 처음 접해봐서 하나 더 풀어봤는데 감이 잡히는 듯 하다.