Hey

i was trying to solve Fixed-Length Paths I with centroid decomposition but I get RTE in all test , I found the exact same problem in codeforces Distance in Tree and tried the same code here and got Accepted

My code : My_Code

Any help would be appreciated .

hello everyone i was reading about point location in cp_algorithms . but i can not understand how it works ,I understand the idea of sweep line but i can not understand how can I find the highest edge lower than me (get event) can any one explane it in a simple way and sorry about my poor english