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/1228
🧭 풀이 시간
70분
👀 체감 난이도
✏️ 문제 설명
정점 N개인 포레스트가 주어진다.
정점 n을 정복하면, 해당 정점을 루트로 하는 서브트리의 모든 점들이 정복되고, 이 때의 비용은 C[n]이다.
적어도 M개의 점을 정복하기 위한 최소 비용을 구해보자.
🔍 풀이 방법
서로 다른 트리에 속하면 영향을 미치지 않지만, 같은 트리에서 겹치도록 두 서브트리를 고르는 것을 막아야 한다.
배낭 DP를 잘 짜주면 풀린다.
⏳ 회고
난 잘 못짜서 고생을 많이 했다