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$$$?
Пожалуйста, прочтите новое правило об ограничении использования AI-инструментов.
→ Обратите внимание
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3839 |
| 3 | Radewoosh | 3646 |
| 4 | jqdai0815 | 3620 |
| 4 | Benq | 3620 |
| 6 | orzdevinwang | 3612 |
| 7 | Geothermal | 3569 |
| 7 | cnnfls_csy | 3569 |
| 9 | ecnerwala | 3494 |
| 10 | Um_nik | 3396 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Um_nik | 164 |
| 2 | maomao90 | 160 |
| 3 | -is-this-fft- | 159 |
| 4 | atcoder_official | 158 |
| 4 | cry | 158 |
| 4 | awoo | 158 |
| 7 | adamant | 155 |
| 8 | nor | 154 |
| 9 | TheScrasse | 153 |
| 10 | maroonrk | 152 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 01.10.2024 11:25:22 (j3).
Десктопная версия, переключиться на мобильную.
При поддержке
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://codeforces.net/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://codeforces.net/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?"