Why does lazy propogation give TLE/MLE for Problem D

Revision en3, by Mikemirzyanov1, 2020-05-17 14:19:58

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?

Tags #segment tree, #lazy propagation

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English Mikemirzyanov1 2020-05-17 14:19:58 0 (published)
en2 English Mikemirzyanov1 2020-05-17 14:15:41 10
en1 English Mikemirzyanov1 2020-05-17 14:15:05 272 Initial revision (saved to drafts)