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.
# | User | Rating |
---|---|---|
1 | ecnerwala | 3648 |
2 | Benq | 3580 |
3 | orzdevinwang | 3570 |
4 | cnnfls_csy | 3569 |
5 | Geothermal | 3568 |
6 | tourist | 3565 |
7 | maroonrk | 3530 |
8 | Radewoosh | 3520 |
9 | Um_nik | 3481 |
10 | jiangly | 3467 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
2 | adamant | 164 |
4 | TheScrasse | 159 |
4 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
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. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
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) |
Name |
---|