In the last div2 B problem, 283258843 isnt this submission O(nlogn) ?? If it is so then why is it getting TLEd :(. Otherwise what is the correct complexity?
→ Обратите внимание
До соревнования
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
38:45:54
Зарегистрироваться »
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
38:45:54
Зарегистрироваться »
*есть доп. регистрация
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 22.11.2024 02:49:08 (i1).
Десктопная версия, переключиться на мобильную.
При поддержке
isn't it O(T(n + q))?
it is O(n + nlogn + qlogn) which is quite efficient
Nah,, It is O(n+nlogn+q).
i am accessing map for every query that adds logn
had the same issue declare k as long long
ohh fuck wowww
Auto comment: topic has been updated by blablabla1803 (previous revision, new revision, compare).
I've just changed endl to '\n' and the type of K to long long and it got accepted 283362761
yah int was the issue, i didnt check the limits of k. Felt quite stupid :)