№ | Пользователь | Рейтинг |
---|---|---|
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 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | awoo | 158 |
4 | cry | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | maroonrk | 152 |
Название |
---|
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