See this... How the hell does creating a 1e5 ish sized array 1e4 times pass?? I think he's probably hacked Codeforces or something...
→ Обратите внимание
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3773 |
| 3 | Radewoosh | 3646 |
| 4 | ecnerwala | 3624 |
| 5 | jqdai0815 | 3620 |
| 5 | Benq | 3620 |
| 7 | orzdevinwang | 3612 |
| 8 | Geothermal | 3569 |
| 8 | cnnfls_csy | 3569 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | awoo | 161 |
| 2 | maomao90 | 160 |
| 3 | cry | 157 |
| 3 | nor | 157 |
| 5 | atcoder_official | 156 |
| 6 | -is-this-fft- | 155 |
| 7 | maroonrk | 154 |
| 8 | adamant | 153 |
| 9 | Um_nik | 152 |
| 10 | djm03178 | 146 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 02.09.2024 01:20:25 (f1).
Десктопная версия, переключиться на мобильную.
При поддержке
I think its fine. That is within the allowed number of iterations if you consider total tests.
1e9 should not pass in 2 seconds
Maximum number of iterations is ~63245 because $$$(N+1)*N/2<MAX$$$ .
So in total it will be $$$6*(1e8)$$$ which is fine.
Even if was a pure 1e9, it still depends on other constants. There are huge differences between performing 1e9 additions and 1e9 prints, and the former even fits in like 0.5s, whilte the latter can't run even in 10s. Pushing to a vector is a little more heavier, but 6e8 still barely fits in 2s.
it's not 1e9 iterations as it's increasing each time like this 1 3 6 10 15 21 27 so it's not 1e9 so it passed
For every test case a new array of at max 1e4 will be created. Which is anyways fine. What is the problem here?
because there are 1e4 testcases, and push_back is slow...
Eliminated.
How did you do it? Can you tell me what testcase you used? I did the maximal one (1 1000000000, repeated 10000 times) and that did not TLE...