blackSnek's blog

By blackSnek, history, 3 years ago, In English

Problem — 1539C

My O(N*log(N)) PyPy3 code got TLE verdict for N — 2e5 (worst case)

Can someone explain what operations are being heavy in my code? and how can I optimize them?

Here is the submission link — submission

Full text and comments »

  • Vote: I like it
  • +14
  • Vote: I do not like it