can anyone please tell me the test case for which this solution link

failed for 30 points for problem laser everywhere of march long challenge 2020

You are using O(NQ) complexity which will be O(10^10) and will cause TLE.

This problem can be efficiently solved using line sweep algorithm.

Here is my video solution for it - https://youtu.be/5X2HbNVBTas

I had solved this question using merge Sort Tree (store vector on segment tree node)

It is O(N*log^2(N)) if I am not wrong ?

It should TLE as well. Intended is O(N*log(N))

2 Likes