Why my solution for this problem got TL?
# | User | Rating |
---|---|---|
1 | tourist | 3856 |
2 | jiangly | 3747 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3591 |
6 | gamegame | 3477 |
7 | Benq | 3468 |
8 | Radewoosh | 3462 |
9 | ecnerwala | 3451 |
10 | heuristica | 3431 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | -is-this-fft- | 162 |
3 | Dominater069 | 160 |
4 | Um_nik | 158 |
5 | atcoder_official | 157 |
6 | Qingyu | 156 |
7 | djm03178 | 152 |
7 | adamant | 152 |
9 | luogu_official | 151 |
10 | awoo | 147 |
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.