This submission gives MLE for using vectors of size 5e6. Why is that? 80500739 I am using binary search with lazy propagation so my algorithm runs in O(q * log(n) * log(n))
. Why should this be a problem.
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
8 | ecnerwala | 3494 |
9 | Um_nik | 3396 |
10 | gamegame | 3386 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | Um_nik | 164 |
2 | -is-this-fft- | 162 |
2 | maomao90 | 162 |
4 | atcoder_official | 158 |
4 | cry | 158 |
4 | awoo | 158 |
7 | nor | 155 |
7 | adamant | 155 |
9 | TheScrasse | 153 |
10 | maroonrk | 152 |
Why does lazy propogation give TLE/MLE for Problem D
This submission gives MLE for using vectors of size 5e6. Why is that? 80500739 I am using binary search with lazy propagation so my algorithm runs in O(q * log(n) * log(n))
. Why should this be a problem.
Rev. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
en3 | Mikemirzyanov1 | 2020-05-17 14:19:58 | 0 | (published) | ||
en2 | Mikemirzyanov1 | 2020-05-17 14:15:41 | 10 | |||
en1 | Mikemirzyanov1 | 2020-05-17 14:15:05 | 272 | Initial revision (saved to drafts) |
Название |
---|