Time Complexity

Revision en2, by sourabh_jangid, 2019-09-11 08:55:26

I am trying to solve 611D - Новый год и древнее пророчество, I wrote 60357814 this solution. I think the Time Complexity of my solution is $$$O(n ^ 2\log{}n)$$$ but I am getting Time Limit Exceeded verdict. I want to know is my Time Complexity analysis is wrong because I saw many $$$O(n ^ 2\log{}n)$$$ solutions are accepted(like 15127310) but not mine.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English sourabh_jangid 2019-09-11 08:55:26 81
en1 English sourabh_jangid 2019-09-10 20:13:10 305 Initial revision (published)