[BOJ 17624] DVOfficer #9
Open
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.
Link
(문제에 대한 링크)
Topic
DP, TREE DP
Approach
For Each Tree node, You can find if (i,j) : (TreeSize i, BlackStone Count j) is available by dp on dfs. this method can cause time limit.
Because each table have continus value range, you don't have to find all value is availible. you can just find for BlackStone j and root node n, possible maximun Tree Size and minimum treeSize.
Then For each query, if Tree Size of query is between tree size max~min of black stone cnt of query, result is 1, else 0.
Note
(남길말)
Who the hell come up with that combination of tree and dp :(