Help!!!A time-out issue with the square root decomposition algorithm.
Difference between en1 and en2, changed 22 character(s)
[The problem](https://codeforces.net/gym/104065/problem/E)↵
My approach was to reroute the edges based on the angle of each point, connecting smaller angles to larger ones, and then iterate through the operation q times in reverse order. For each point, I maintained its father's value using a set, and then brute-forcefully calculated the son's values. I believe the complexity of this approach is also root-level, but unfortunately, it TLEd. I don't understand why this is the case, and if there are any experts who can give me some guidance.
[submission:291437222]

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English qzhfx 2024-11-14 15:44:20 22 Tiny change: ' guidance.' -> ' guidance.[submission:291437222]'
en1 English qzhfx 2024-11-14 15:40:16 613 Initial revision (published)