jiangbowen's blog

Rejudge demand for my submission in Round 807
By jiangbowen, history, 22 months ago, In English

Hello community.

In codeforces round 807 Task E ,I submitted a code which passes pretests. However, it used 1996 ms on Pretest 7.

After system testing, I got a TLE on test 7 , which is actually a pretest and I passed it in the round.

Also, after the round,I submitted my code for two times, and one of them passed with 1996ms .

geranazavr555 MikeMirzayanov please rejudge my 164337373 and update my rating.

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

Comments Comments (18)
| Write comment?
»
22 months ago, # |
  Vote: I like it -29 Vote: I do not like it

stO jbw Orz

→ Reply
»
22 months ago, # |
  Vote: I like it +12 Vote: I do not like it

damn you were so close to master

→ Reply
»
22 months ago, # |
  Vote: I like it +18 Vote: I do not like it

Hope you can go to Master by rejudge.

→ Reply
»
22 months ago, # |
  Vote: I like it +4 Vote: I do not like it

2099 is so outrageous

→ Reply
»
22 months ago, # |
  Vote: I like it -8 Vote: I do not like it

Hope you can rejudge successfully.

→ Reply
»
22 months ago, # |
  Vote: I like it -95 Vote: I do not like it

so what do u want to express by writing this blog

→ Reply
»
22 months ago, # |
  Vote: I like it -38 Vote: I do not like it

stO jbw Orz

→ Reply
»
22 months ago, # |
  Vote: I like it 0 Vote: I do not like it

why so many downvotes?

→ Reply
»
22 months ago, # |
  Vote: I like it +32 Vote: I do not like it

I think rejudge is unfair, please delete this blog.

→ Reply
»
22 months ago, # |
  Vote: I like it -42 Vote: I do not like it

I think this post is reasonable.

→ Reply
»
22 months ago, # |
  Vote: I like it +49 Vote: I do not like it

Previous similar post: https://codeforces.com/blog/entry/97390

→ Reply
»
22 months ago, # |
  Vote: I like it +56 Vote: I do not like it

It seems that your code has a complexity of $$$O(n\log^2n)$$$ which is higher than the normal ones somehow.(the Editorial has the complexity of $$$O(n\log n)$$$ and my solution using the complexity of $$$O(n\log^2n)$$$ got TLE on pretest which made me to write a code using the complexity of $$$O(n\log n)$$$) Anyway, hope you can reach Master soon.(At such a young age)

→ Reply
»
22 months ago, # |
  Vote: I like it +2 Vote: I do not like it

but I think that you are only 13，I do not think it is difficult for you to achieve master next time.

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

I don't think it reasonable. However, I have pity on you.

Hope you can achieve your dream next time!

→ Reply
»
22 months ago, # |
  Vote: I like it +25 Vote: I do not like it

In my opinion, whatever the result may be, there will always be people who are against it. Anyways, this kind of incidences have happened many times and rejudge is somehow unfair to the other contestants. Maybe I hope that Codeforces would not retest the pretests when system testing, which is very confusing to the contestants when they have no idea of it. Also hope you can achieve your goal next time!

→ Reply