→ Обратите внимание
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3690 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 163 |
| 4 | TheScrasse | 159 |
| 5 | nor | 157 |
| 6 | maroonrk | 155 |
| 7 | -is-this-fft- | 152 |
| 8 | Petr | 146 |
| 8 | orz | 146 |
| 10 | BledDest | 145 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 18.05.2024 03:42:15 (g1).
Десктопная версия, переключиться на мобильную.
При поддержке
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