# | User | Rating |
---|---|---|
1 | tourist | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
1 | maomao90 | 161 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | atcoder_official | 149 |
6 | -is-this-fft- | 148 |
6 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 144 |
10 | TheScrasse | 143 |
Name |
---|
I think so but it is an old problem so maybe bad test cases?
I tried it on my local machine with this testcase:
"a"*100000 + "bc"*50000
it passed in 200ms :)
This solution uses ovidiush11's trick. String erase is apparently O(0). I hope he can explain with more details because I am not good enough for this obscure idea yet.
Marinush
what is O(0)
Takes exactly 0 time, else it can't be bounded above by a multiple of 0
Well, technically every code is $$$\Omega (0)$$$ ;)
Hi, your comment is not funny nor helpful. Next time, please refrain from writing such comments.
Please, live a life.
Sure thing, you too :)
Hi, your comment is not funny nor helpful. Next time, please refrain from writing such comments.
Please, live a life.
Hi, your comment is not funny nor helpful. Next time, please refrain from writing such comments.
Please, live a life.
It is $$$O(n^2)$$$, but all your operations are basically
memcpy
, so the constant factor is really small.I see...
thanks for the answer
order is n^2 but Coefficient is small