Problem Link I have used segment tree with Lazy Propagation to solve this problem. I have tested my code for large values of n(10^5) and q (10^5) on my machine and it takes between 1.5 to 2 seconds to execute… Since the time limit is 0.13 seconds can anyone tell how can I further optimise my code…
Link to my code