→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3408 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 134 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Nov/07/2026 22:24:14 (g2).
Desktop version, switch to mobile version.
Supported by
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