Getting TLE on test case 8 for this problem. I read the editorial which had O(n) complexity. My soln has a complexity of O(n *log n) but as n has an upper bound of 2e5 it should pass right (if it is correct)?
→ Обратите внимание
До соревнования
Helvetic Coding Contest 2024 online mirror (teams allowed, unrated)
34:22:49
Зарегистрироваться »
Helvetic Coding Contest 2024 online mirror (teams allowed, unrated)
34:22:49
Зарегистрироваться »
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3690 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 165 |
| 3 | adamant | 161 |
| 4 | TheScrasse | 160 |
| 5 | nor | 158 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 152 |
| 8 | orz | 146 |
| 9 | SecondThread | 145 |
| 9 | pajenegod | 145 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 02.05.2024 23:42:12 (k3).
Десктопная версия, переключиться на мобильную.
При поддержке
The link isn't working
My bad....updated
This "cur=cur+t[nc];" works for O(|cur|) Change it to "cur+=t[nc];".
I would have never found it.......Never thought about it in terms of complexity before this....Thanks
Auto comment: topic has been updated by AbhishekAg (previous revision, new revision, compare).