SPOJ QTREE4
Need help! I tried to solve SPOJ QTREE4. I used centroid decomposition, but still getting TLE (time limit exceeded). In my code, a query is processed in O(log(n)^2). How can I improve complexity? Any suggestions. Here is my code.
Colin X Sam X Shayan | Easy Problems Duel | NAC Warmup #1
Codeforces Round 946 Solution Discussion