ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1019. Line Painting

The 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.
Posted by die_young 21 Jul 2018 14:54
Yes. Compressing coordinates and painting segments straightforwardly is enough.