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?
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) |