TwoFx's blog

Inexplicable TLE using MS C#
By TwoFx, history, 8 years ago, In English

Hi,

can anyone help me with a TLE on 20648075? It should be O(n log n), and I seem to be able to handle cases with n = 100000 locally in less than 100 ms, but I get TLE on test 22 when submitting.

Thanks in advance

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

»
8 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Just look at the test :) It's antiquicksort, version against (l+r)/2

→ Reply
  • »
    »
    8 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Thanks :) Switching to another way to sort provided by .NET which uses Introsort got AC.

    → Reply