http://acm.timus.ru/problem.aspx?space=1&num=1613
Hi, i am trying to solve this problem using SQRT decomposition but i am getting TLE, how can it be optimized more or is my approach wrong.
Here is my code: https://ideone.com/tnuvKA
# | User | Rating |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 161 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
http://acm.timus.ru/problem.aspx?space=1&num=1613
Hi, i am trying to solve this problem using SQRT decomposition but i am getting TLE, how can it be optimized more or is my approach wrong.
Here is my code: https://ideone.com/tnuvKA
Name |
---|
I think you got TLE because you were doing binary search on each block. You can speed it up by using MO's Algorithm + Compression.
I know MO's algorithm but don't really know the compression part ?
Did you notice that the count of different number of X is at most (N + Q) ? Nah, just compress it into smaller number.
yeah i did and i think if i use map it would be the same problem like binary search so i need to count in an array. Right ?
Ya. :)
Thank you my friend for your help. Got it Accepted :)
You're welcome.