codeforce 规则_codeforce1500是什么概念

http://codeforces.com/blog/entry/456

The text contains only preliminary rules of Codeforces contests – something surely will change. In particular, I hope to help the community to find the illogic in the rules. However, I have already discussed the format with programming contests dinosaurs and made unrated alpha contests – it seems rules are OK.

I think than the format 5 tasks x 2 hour is quite good. For this reason, in the near future we will not change it, but of course, experiments are possible.

1. Before the competition all participants are divided into rooms, each room contains about 20 participants. For now random strategy works, but after a while it will be somehow correlated with the rating.

2. The start of contest looks quite like ICPC: all problems immediately available for viewing/solving, the statements are simple and understandable. Choose the problem and begin to solve it. I think the idea to order problems by difficulty is good. The aim of the participant is to earn as much scores as possible.

3. The cost of the problem can be determined by the following table. For example, if the problem B was solved after 10 minutes of contest, then it costs 1000 – 4 * 10 = 960 points. For each attempt there is penalty of 50 points. So, if the problem B was solved after 10 minutes from the beginning with the third attempt, the score for it is 1000 – 4 * 10 – 2 * 50 = 860 points. However, no matter how much attempts you did and when you solved the problem, the cost of the solution can not drop below 30% of points (see the column “Min. Score (30 %)”).

Problem

Max. score

Min. score (30%)

Loss (points per minute)

Score at the contest end

A

500

150

2 points

260

B

1000

300

4 points

520

С

1500

450

6 points

780

D

2000

600

8 points

1040

E

2500

750

10 points

1300

4. And now comes the time when you solved the problem and submitted it. It will be checked only on preliminary testset (also we call such tests “pretests”). It is known that pretests do not check solution completely. Usually there are 2-10 pretests, and the fact that the solution passed pretests says only that it is quite reasonable. Typically pretests not contain the maximal tests, corner cases, etc.

5. Once your solution passed all the pretests, you’ll get points for solved problem (see formula I described above). Also you now have an alternative – that is, if you are confident in the correctness of your solution, then you may want to lock this problem for yourself. If you have locked the problem, you will not be able to resubmit it under any circumstances. On the other hand you’ll get the interesting possibility of hacking other participant’s solution of participants from your room.

6. If during the contest, you have solved the problem, then it is locked, you can view and try to hack solutions of participants from your room. In the process of hacking, you can offer a test (or a generator program which outputs it to the standard output) on which hacking solution will not work correctly. If your test really breaks hacking solution, then it will become “Hacked” and its author will loose scores for it. Also he/she will receive announcement about successful hacking attempt and if the problem was not locked by him/her, author may fix the solution and resubmit it. But while resubmitting the solution will be judged not only on pretests, but on the hacking test(s) too. The hacking tests are unknown to the victim.

7. The target for any hacking attempt is the last currently accepted solution for this problem.

8. You may resubmit the solution at any moment, but it may reduce your score. It happens if resubmission is successful (i.e. passes all the pretests + previous hacking attempts). In this case, the previous successful attempt would be considered as a reason for penalty (see item 3).

9. After a successful hacking attempt you’ll get 100 points.

10. After unsuccessful hacking attempt you’ll loose 50 points.

11. If you have locked a problem, but your solution has been hacked, then you can still hack other participant’s solutions.

12. Hacking attempt should contain a manual test or a test generation program (generator). Generator is a program which outputs the test to the standard output. The generator should always give the same test, for example, you can not initialize the random using the current time, etc. In any case, you have to follow very closely the format of the test. Each line should end with a newline.

13. Hacking attempt can be ignored. This happens in several cases: the test is invalid, generator fails, victim resubmitted the problem while hacking, concurrent hacking attempt was successful.

14. Of course, during the competition it is forbidden to communicate with other participants, do not use others code for solutions/generators, share ideas, solutions or hacks. In general, violation of the rules of sports and personal ethics can lead to disqualification. It is prohibited to access the network, attack system security, work with filesystem, try to hack the judge and etc. In short, respect yourself and others.

15. Solution code obfuscation and creation of obstacles to reading and understanding the solution is prohibited. It is forbidden to use any special techniques designed to complicate the reading of the code, to understand its workflow.

16. After two hours of entertainment contest ends. For each participant we choose the latter solution for each problem (of course, only successful). All such solutions are rejudged on the final set of tests. As a result, some solutions fail. The final result for the competition is the sum of scores for all the solutions that have passed final testing, plus the scores that you have received (or, conversely, lost) while hacking.

All, finita la comedia, that is, game over.

Waiting for your opinions,
MikeMirzayanov