Everyone says it's 10^9 operations, but that's way too slow.
Everyone says it's 10^9 operations, but that's way too slow.
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 4 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
I believe it's around 1e8 operations per second
Could you please tell how much exactly ?
No, and nobody can. It depends on how cache-friendly your operations are and how much can the compiler cut out from your branching, plus then you have to check every inbuilt function for its complexity. It is better to think that 2-3e8 operation can pass on CF with average operations, up to 1e9-5e9! if they are cache friendly, and < 1e8 "heavy" operations (umap, sqrt, modulo, division) and so on.
It depends on how cache-friendly your operations are and how much can the compiler cut out from your branching
Would you elaborate more on this part?
i think it's 4e8 (4 * 100000000).
~5 operations/sec
The only trustible way to see how many loops your code can run in one second is to simply stress test it. (i.e. generate random data incrementally and test them against your code to see how much it can run)
If you mean how many "instructions" though, you can just do $$$\text{IPC} \cdot \text{(Clock Speed)}$$$
the machines of codeforces can run about 3e9 times per second, i tried 5e9 and it didn't TLE, but the machines of other online judges usually runs 5e7-5e8 per second