Eric12's blog

Why TLE?
By Eric12, history, 4 years ago, In English

I submitted this to 527C: h[submission:167938194]

I'm sure that it's O(nlogn) ($$$n \leq 2 \times 10^5$$$), and I TLEed on 7.

Please help me!

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

»
4 years ago, hide # |
 
Vote: I like it +3 Vote: I do not like it

I think your solution took more time than what was allowed for the problem. That is why it is showing TLE.

→ Reply
»
4 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

It's not a TLE.

Your code return Exit Code 134. You have some troubles with pointers on this test.

10 10 10
V 6
H 8
V 4
V 8
H 2
H 5 <- Your code breaks here.
V 9
H 7 
H 3
V 7

Try to debug it and check what does your multisets returns to you.

→ Reply