used Go, python, D, C, C++.
I was saving java for harder problems, but it remained saved and contest ended. :D

In dp(n, mask), we can modify mask to mask only 30 bits, because we will not subtract x (x > 30) from n more than once.
solution : 24854077

While calculating weight of subtrees, whenever weight of a subtree equals totalheat/3 push it into ans vector and return 0, because it will not be contributing in it's parent. It will handle the removal of that subtree.
24775716

Yeah, time limit in D was too strict.
Submited using :
Binary Search and Sorting : TLE on test 8 24776219
Binary Search and Two Pointer with cin/cout : TLE on test 9 24776253
used scanf/printf : AC 24775689

Thanks for this nice explanation, but does it follow even if we don't use random shuffle and just pick starting 300 elements of input ??

What is the solution of LINE problem??
I noticed many contestants using random shuffle and 300 as the upper bound of the points needed to be considered as center. Is there a proof for such an assertion??
Also some solutions don't even use random shuffle (just 300 as upper bound).

awesome..but what if we can build android application using python too?? suggest me you got something. :)

missed it :(