The repository that contains all solutions made for the course Competitive Programming and Contests by the University of Pisa
Solved | Solution | Time |
---|---|---|
Segment Tree | > 1500 ms (TLE) | |
LazySegmentTree | 811 ms |
The Solution of this problem is discuss on the Segment Tree: A Compleate Introduction paper. However, the solution require the Lazy Segment Tree, and also need to check inside the logic if the query is circular, if yes is required make two different query to simulate the circular segment.