CommonLounge is a community of learners who learn together. Get started with the featured resources above, ask questions and discuss related stuff with everyone.
DP On Trees Problem (CodeForces)
This is a DP on Trees problem. Unless I'm mistaken, the question basically requires us to:
Divide the tree into a number of (different) connected subsets of nodes (or sub-trees) in the tree, with at least one of the sub-trees having exactly K nodes. Then, output the number of edges connecting the different sub-trees.
Any hints? The editorial is unavailable unfortunately. :/
Solution here at my blog, if anyone is interested:
I got selection to IOITC this year. I would like to know more about the camp and topics which will be discussed there. Will they teach the whole syllabus of IOI in the camp within a span 10 days? What all should I learn before attending the camp in order to understand everything discussed there in a more better way?
This seems to be quite an interesting problem from IOITC 2013.
Problem in Short: You are given N distinct points on a plane where distances are measured using the Manhattan metric. Find the number of ordered triplets of distinct points (A;B;C) such that the sum of distances from A to B and B to C is equal to the distance from A to C.
I have been trying this problem for quite some time but unable to come up with a solution to pass the following constraints: N<=10^5 and |xi|<=10^9 , |yi|<=10^9.
Some hints to get me unstuck would be highly appreciated. Thank you.