622C - Not Equal on a Segment 15943480 It gives TLE on test case number 14!
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
622C - Not Equal on a Segment 15943480 It gives TLE on test case number 14!
Name |
---|
A long code without any explanation. Don't be surprised that you don't get help.
EDIT — The next paragraph is bullshit, don't read it.
I have read your code and I think its complexity is O(n·m) because of line:
p=lower_bound(h[x].begin(),h[x].end(),l);
Note that
lower_bound()
is linear for vectors. Write your own binary search there.http://www.cplusplus.com/reference/algorithm/lower_bound/
Lower bound is O(LogN) for random access containers is what is mentioned here..Is lower_bound really linear for vectors?
No.
Damn. I messed it up with
lower_bound
inset
. Sorry everyone!Of course it is logarithmic for vectors as they are random-access containers. Did you mean anything else?
lower_bound(x.begin(),x.end(),a)
->x.lower_bound(a)
That syntax is only true in case the container has lower_bound as a member function. So it's valid for something like sets, but not valid for vectors.
No its not linear. The same got AC with fast I/O and using iterative binary search.
Replace endl with "\n".
And pass vectors by reference in functions
flr()
andsr()
.