Why my solution for this problem got TL?
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | cry | 158 |
4 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | Dominater069 | 152 |
Why my solution for this problem got TL?
Name |
---|
i am getting TLE on the same test case . My soln : http://codeforces.net/contest/749/submission/23175411
It works O(N) on worst case, so in total it will be O(N * Q * log(N)).
I hear that complexity of lower_bound is O(n) for some cases.
It works O(N) on non-random-access iterators.
With my own binary search
It works O(size), that's why you got tle. Try using references.
Ty mate!!! Lost about day for searching mistake.