I want to ask question about problem 380C.

Revision en1, by astar0n, 2019-07-19 11:32:01

380C In this problem I have sumbitted Solution which got failed test case 13. I don't know how to not get my time limit exceede. I have seen other users solution, but nothing I can understand as most of them seem to use same recursive method which is same as implementation of segment tree. I have read a blog post of efficient implementation. But I don't understand why my solution couldn't pass the test 13 with an error of time limit exceeded. Can someone help me with this ?? Thanks for your help.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English astar0n 2019-07-19 11:32:01 695 Initial revision (published)