Tomorrow, on April 5th 2017, at 15:35 UTC the first Wild-card Round of VK Cup 2017 will be held. Along with it there will be parallel unofficial round in which everyone can take part.
The rounds will use special rules, the rounds will be unrated. The problems were prepared by Codeforces team.
The detailed rules will be added to this post 30 minutes before the rounds. I can say now that there will be 24-hours open hacks phase after the round, like in Codeforces Educational Rounds.
The round will be almost usual contest with ACM ICPC rules. There will be 12 problems for 2 hours. During the round your solutions will be tested on some basic tests, they should be much stronger than usual pretests. After the round you will have 24 hours to find tests against other participants’ solutions, this part is the same as in Educational rounds. After that we will add all succesful hacks and our tests and rejudge all submissions. Then the results will be final.
The main difference between ACM ICPC rules and this round is the following rule.
You should submit each problem in a unique programming language. Different compilers of same language are considered the same language. For example, GNU G++, GNU G++ 11, GNU G++ 14 and MS C++ compilers are C++ language. Thus, you are not only to solve problems, but also try different and new for you languages. We don’t think you know 12 languages, we hope that you will quickly learn some basic syntax.
Formally, the following check is performed when you submit a task:
- If there is at least one submission in queue or submission that passed at least one test for this problem in another language, your solution will be ignored. Thus, if your program passes at least one test, you can only solve this problem using this language.
- If there is at least one submission in queue or submission that passed at least one test for another problem in same language, your solution will be ignored. Thus, you can’t use a language for more than one problem.
Remember that you can view filter status of some other round by language and view submissions in a specific language. Also, you can view examples of codes in any of the supported languages on the table below. Also, the table contains the groups of compilers considered the same language.
You can use “custom invocation” tab to run a solution if you don’t have the compiler locally.
|C||GNU C, GNU C11||10903473, 17029870|
|C++||GNU C+, GNU C++11, GNU C++14, MS C++||23794425, 5456501|
|C#||Mono C#, MS C#||3195513, 3794163|
|Java||Java 8||25491359, 23678167|
|Pascal||Delphi, FPC||1275798, 1259434|
|Python||Python 2, Python 3||4432133 (Py2), 15729882 (Py3)|
The main rules of ACM ICPC contest: each problem can either be completely solved (when all tests are passed), or not solved. The participants are ranked by the number of solved problems, in decreasing order, in case of a tie they are ranked by penalty time. The penalty time is the sum among all problems the time in minutes that had passed between the start of the round and the moment the problem got solved, plus 20 minutes for every rejected submission. Note that the problems are not arranged by difficulty. Also, you can resubmit a solution even if it passed all tests, because there will be more tests after the open hacks.
Open hacks phase has ended, the solutions are rejudged. Congratulations to winners!