Hi

These are some problems about Centroid Decomposition , you can learn this algorithm here .

Its complexity is O(nlogn)

I hope these problems would be useful for you :)

• 321C - Ciel the Commander

• 766E - Mahmoud and a xor trip

• 716E - Digit Tree

• 161D - Distance in Tree

• 776F - Sherlock's bet to Moriarty

• 379F - New Year Tree

• 342E - Xenia and Tree

• 293E - Close Vertices

• 150E - Freezing with Style

• 348E - Pilgrims

If there are another problems on CF please put it on comment !!

UPD : The list has been updated