Hello communtiy, I have been solving a problem of Heavy Light Decomposition(HLD) on cses,Path Queries II. It is passing all the test cases except the penultimate one. As per my understanding I have written the optimal one. Plz advice me what more i can do in this solution to pass it.
Thanks.
Problem link:CLick here
Source code: 261194019
P.S: I just submitted my source code to a random codeforce problem just to get it as a submission link.
It also happened to me. Use loop segment tree not recursive segment tree
Hi guys i am getting tle in distance quries,pls check my code
https://cses.fi/paste/82855b2d36cb16e78d8697/
prb link https://cses.fi/problemset/task/1135/
pls suggest getting tle in middle 4 to 5 cases.
Thanks bro..it got accepted now.