Is 1,5 seconds enough for O(10^10) in c++?
→ Обратите внимание
До соревнования
Rayan Programming Contest 2024 - Selection (Codeforces Round 989, Div. 1 + Div. 2)
10:53:23
Зарегистрироваться »
Rayan Programming Contest 2024 - Selection (Codeforces Round 989, Div. 1 + Div. 2)
10:53:23
Зарегистрироваться »
*есть доп. регистрация
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 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 | 155 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 10 | djm03178 | 152 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 30.11.2024 06:41:39 (k3).
Десктопная версия, переключиться на мобильную.
При поддержке
Auto comment: topic has been updated by huseynahmadli2010 (previous revision, new revision, compare).
It depends on the operations the solution is doing.
Very roughly, $$$10^8$$$ operations can be done in 1 second. $$$\frac{10^{10}}{10^8} = 100$$$, so $$$10^{10}$$$ operations would take about 100 seconds.
The actual time it takes may vary and its better to have a good understanding about how the time complexity and execution time form.
but if it will be 2 seconds it will be AC so how do you explain this?
Maybe the complexity was calculated incorrectly. Also maybe pragmas and optimizations could change the execution time. Can you provide an example of $$$10^{10}$$$ solution getting AC?
With bitset $$$10^{10}$$$