| № | Пользователь | Рейтинг |
|---|---|---|
| 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 |
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.