This is my solution for 86D : Powerful Array. Link: http://ideone.com/618TcS
This gave me a TLE at test 6, taking more than 5000 ms whereas most AC solutions pass at 800 — 1000 ms. How do I optimize my code? Thanks in advance!
# | User | Rating |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 166 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 151 |
6 | nor | 150 |
7 | atcoder_official | 147 |
7 | SecondThread | 147 |
9 | TheScrasse | 146 |
10 | Petr | 145 |
This is my solution for 86D : Powerful Array. Link: http://ideone.com/618TcS
This gave me a TLE at test 6, taking more than 5000 ms whereas most AC solutions pass at 800 — 1000 ms. How do I optimize my code? Thanks in advance!
Name |
---|
I believe this should be enough
Thanks for the quick response! But it still does not pass.
Actually I submitted it and got AC. Maybe you submitted something wrong.
Thanks, it passed. But this solution is exactly the same: http://ideone.com/kKKV97
Why is it so slow?
EDIT: Found the mistake. Thanks for the quick help!
Well, in MO's algorithm, usually, every bucket shoud be sorted in ascending order by R. Your comparator does not guarantee that.
I am having the same problem. I submitted using MO's Square Root Decomposition, it gave TLE on 6 testcase. My submission.
I believe that removing maps will greatly optimize your code.
Thanks for suggestion. It might work.
Use this cmp to sort queries:
This would be helpful.
That is really interesting. Thanks!
Can you help me understand how is this more optimal?
Hint: How does the right pointer move in a bucket?