SPOJ POSTERS TLE (Segment tree).

Revision en5, by rr459595, 2018-04-16 17:24:05

I am getting TLE in this problem. I used lazy propagation with co-ordinate compression.

Link of the problem:- http://www.spoj.com/problems/POSTERS/

Code:- https://pastebin.com/cy0Zvx0Q

How do I apply co-ordinate compression here ?

If points (1,4), (2,6), (8,10), (3,4), (7,10). If I sort it and stor the indices in hashmap, then (1,2,3,4,6,7,8,10) will be compressed to (1,2,3,4,5,6,7,8).If I compress it this way then it fails for this test case.

6

1 3

4 6

6 7

8 1

1 2

3 4

I get answer as 4 because poster 2 at point (5,5) is not stored here as we have no index for 5.

I am newbie to this topic. Any help would be appreciated.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en5 English rr459595 2018-04-16 17:24:05 2 Tiny change: 'se poster 3 at point ' -> 'se poster 2 at point '
en4 English rr459595 2018-04-15 23:50:09 2 Tiny change: 'st case.\n6 \n\n1 ' -> 'st case.\n\n6 \n\n1 '
en3 English rr459595 2018-04-15 23:49:49 18
en2 English rr459595 2018-04-15 23:46:10 437
en1 English rr459595 2018-04-15 20:56:48 258 Initial revision (published)