|
|
back to boardThe problem is easily solvable without segment tree. Posted by Jorres 11 Nov 2017 22:53 Also pay attention to the fact that according to the example - segment is (a;b]. I used this approach and got accepted. (O (N*N) btw :) ) Re: The problem is easily solvable without segment tree. Yes. Compressing coordinates and painting segments straightforwardly is enough. Re: The problem is easily solvable without segment tree. Posted by Solver 16 Jun 2026 11:49 It's also easily solvable with heap at O(N*log(N)) |
|
|
