I know it is an overkill to use Priority Queue in recent Div 2 problem C but why does using it gives TLE on test case 32 in problem C ? isn't it O(nlogn), which should pass ?
→ Обратите внимание
До соревнования
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
30:17:02
Зарегистрироваться »
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
30:17:02
Зарегистрироваться »
*есть доп. регистрация
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 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 11:18:00 (j3).
Десктопная версия, переключиться на мобильную.
При поддержке
It is possible to use Priority Queue without getting TLE. check
But our implementations are different and no of Queue operations are higher in your solution. Maybe optimizing could get you off TLE. I have trouble understanding your code so i don't have any suggestions. Good luck tho :)
Edit: fixed the link No i can't :\ link : https://codeforces.net/contest/1348/submission/78739940
Yes. The Priority Queue is O(nlogn) but string comparison is very costly O(n) so the overall time complexity is O(n^2logn)