| № | Пользователь | Рейтинг |
|---|---|---|
| 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 |
This code memset 3e5 element every testcase.
With 10^4 test case, the number of operation is equal to 3*10^9.
So why does it run in 1.5s. As I know, C++ run 3*10^8 operation every second.
Is it because CF judge is fast?
Note that this is not because the test is weak, test case 3 has 10000 test case. Still, the code can pass this test
$$$3*10^8$$$ operations per second is a good "rule-of-thumb" guideline. In practice things are more complicated and it depends on the operations.
Generally memset is extremely fast, even if linear asymptotically. Depending on the compiler/architecture it may do less operations (if zeroing chunks of bytes at once is supported by the architecture), or it may just do the operations much faster by levering some low-level optimizations due to the simplicity of the operation.
In a nutshell, memseting $$$3*10^9$$$ in 1.6s sounds very plausible.