→ Обратите внимание
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | jiangly | 3898 |
| 2 | tourist | 3840 |
| 3 | orzdevinwang | 3706 |
| 4 | ksun48 | 3691 |
| 5 | jqdai0815 | 3682 |
| 6 | ecnerwala | 3525 |
| 7 | gamegame | 3477 |
| 8 | Benq | 3468 |
| 9 | Ormlis | 3381 |
| 10 | maroonrk | 3379 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 168 |
| 2 | -is-this-fft- | 165 |
| 3 | Dominater069 | 161 |
| 4 | Um_nik | 159 |
| 4 | atcoder_official | 159 |
| 6 | djm03178 | 157 |
| 7 | adamant | 153 |
| 8 | luogu_official | 151 |
| 9 | awoo | 149 |
| 10 | TheScrasse | 146 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2025 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 31.01.2025 15:20:43 (j1).
Десктопная версия, переключиться на мобильную.
При поддержке
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