brave-kid's blog

By brave-kid, 6 weeks ago, In English

This submission gets Time limit Exceeded with this generated input making the complexity reach $$$O(N^2*logN)$$$:

code

But then I obviously optimized my code and made it unhackable unhackable submission

BledDest please add the hack test mentioned above in the tests of the problem

  • Vote: I like it
  • 0
  • Vote: I do not like it

»
6 weeks ago, # |
  Vote: I like it +3 Vote: I do not like it

xplain your approach boi

»
6 weeks ago, # |
  Vote: I like it +8 Vote: I do not like it

Sure, added the test but with 2e5 instead of 1e5. Won't be rejudging any submissions, but all later submissions will be judged on that test.