Dardy's blog

Uphacking Old Problems
By Dardy, history, 4 years ago, In English

According to: https://mirror.codeforces.com/blog/entry/68204

MikeMirzayanov announced a way to uphack recent problems for Div.1 participants. I'm curious to listen to the details on why this is limited only to last week problems. He clarified why it was limited to Div.1 participants but not why only recent problems.

I mean, for instance I believe that Educational Round 3B is hackable with this test case (as many participants don't use long long for the length of the frog's tongue):

1 200000
1 0
1 1000000000
1 1000000000
1 1000000000
...

So what is the harm in enabling uphacking for old problems as well?

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

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

If I remember correctly this was asked before and the main issue was that if there are validator / checker bugs in older contests that cause unexpected verdicts with cases not seen in the contest its not exactly feasible to contact whoever wrote those contests to fix them.

→ Reply
»
4 years ago, # |
← Rev. 3   Vote: I like it +26 Vote: I do not like it

Mike has answered your question in this comment

His comment
→ Reply