karthiksing05's blog

Question about time complexity for a certain piece of code:
By karthiksing05, history, 15 months ago, In English

hey guys! so i was working on this problem Stick Division on CSES on the USACO Guide. Eventually I got the right answer, but one of my first submissions was this LINK, which I thought ran in O(N^2) time: was very surprised to see that it ran through without being timed out seeing as N was a maximum of 10^5 (ofc 2 out of the 6 test cases passed anyways so still problematic). To summarize: my question is, what's the time complexity of this and if it's higher than O(NlogN), why did it run this way?

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

Comments Comments (2)
| Write comment?
»
15 months ago, # |
  Vote: I like it +2 Vote: I do not like it

Link doesn't work for me :((

→ Reply
»
15 months ago, # |
← Rev. 2   Vote: I like it +5 Vote: I do not like it

Guy you'd better delete the extra close parenthese to save your link.

Like this:[LINK](https://pastebin.com/KpAgqLUN) will be LINK

→ Reply