zarif_2002's blog

By zarif_2002, history, 5 weeks ago, In English,

1181D - Irrigation I have really a little idea about time complexity but I think this one of mine works in O(n logn). But, it is getting tle. Please help me to avoid the tle and make me understand why I got tle. sorry for my poor english.

55677921

 
 
 
 
  • Vote: I like it
  • -11
  • Vote: I do not like it

»
5 weeks ago, # |
Rev. 2   Vote: I like it +14 Vote: I do not like it

Do you honestly think that people are going to spend time to read your code when all you provide is a bunch of unreadable code with no explanation of your logic at all?