This submission gives MLE for using vectors of size 5e6. Why is that?
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 | 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 | 166 |
2 | maomao90 | 163 |
2 | Um_nik | 163 |
4 | atcoder_official | 161 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | nor | 153 |
9 | Dominater069 | 153 |
Why does lazy propogation give TLE/MLE for Problem D
This submission gives MLE for using vectors of size 5e6. Why is that?
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) |
Название |
---|