How fast is CF Judgers?
How long will it run a program (in C++) that its time complexity is $$$O(N)$$$ and $$$N = 10^8$$$? What about $$$N = 10^9$$$?
→ Обратите внимание
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3993 |
| 2 | jiangly | 3743 |
| 3 | orzdevinwang | 3707 |
| 4 | Radewoosh | 3627 |
| 5 | jqdai0815 | 3620 |
| 6 | Benq | 3564 |
| 7 | Kevin114514 | 3443 |
| 8 | ksun48 | 3434 |
| 9 | Rewinding | 3397 |
| 10 | Um_nik | 3396 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 156 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 24.11.2024 07:23:43 (i2).
Десктопная версия, переключиться на мобильную.
При поддержке
Auto comment: topic has been updated by xcx0902 (previous revision, new revision, compare).
It depends on a lot of factors, but, as a rule of thumb, 10 ^ 8 operations are done in 1 second.
You are wrong. Now that number is 10^9, or at least 4 * 10^8
You can easy check it by yourself. For example in such way: https://mirror.codeforces.com/contest/1702/submission/165129718
It isn't actually important what is the time complexity, but how many operations you perform.
Before you ask about judger performance, learn some faster algorithms.
https://mirror.codeforces.com/blog/entry/21344
Might help if you want to know "How to determine the (expected) complexity of expected solution of a problem by looking at its constraints?"