| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
In Codeforces Round 635 (Div. 2) ,I tried to hack this submission 76834239 but failed.
His time complexity seems to be $$$O(Td)$$$
The hack I used was
$$$1000$$$
$$$1\space 1 \space 1\space 10^9$$$
$$$1\space 1\space 1\space 10^9$$$
$$$1\space 1\space 1\space 10^9$$$
$$$\dots$$$
Why would this fail?
Does it have something to do with the language he chose?
I think it's because on Codeforces, O2 is always turned on.
On my computer, if I choose O2, it seems that the complexity has been optimized to $O(1)$。
Thank you very much.