Welcome to the sixth Don Mills Open Programming Competition of the school year!
The problem writers this time are FatalEagle and Xyene.
For this contest, we will introduce pretests in an attempt to stop people from printing a random answer and scoring points. You must pass all pretests to score points for a problem. Pretests are guaranteed to comply with all subtask specifications; as such, they may or may not be included for each problem. Pretests will generally be small tests that should be passable with brute force. The sample input will always be included as the first few pretests.
The theme for this month's contest is Tengen Toppa Gurren Lagann.
The contest consists of 6 questions with a wide range of difficulties, and you can get partial marks for partial solutions in the form of subtasks. If you cannot solve a problem fully, we encourage you to go for these partial marks. The difficulty of a problem may be anywhere from CCC Junior to CCO level. You will have 3 hours to complete the contest. Check when the contest begins in your timezone here.
After joining the contest, you proceed to the Problems tab to begin. You can also go to Users if you wish to see the rankings.
We have listed below some advice as well as contest strategies:
- Start from the beginning. Ties will be broken by the sum of times used to solve the problems starting from the beginning of the contest. The last submission time of your highest score will be used.
- It is strongly advised to run your code on your own computer with the sample input we provide before submitting. It's faster to find and fix mistakes at this stage rather than submitting and waiting only to find out that your solution doesn't compile.
- Remove all extra debugging code and/or input prompts from your code before submitting. The judge is very strict — most of the time, it requires your output to match exactly.
- Do not pause program execution at the end. The judging process is automated. You should use
stdoutto perform input / output, respectively.
- Just because your program works with the sample input doesn’t guarantee that it will earn full points. Read the problem statement very carefully to look for things you may have missed on the first read-through. It is not forbidden — in fact, even encouraged to make your own test cases to debug your program on.
- The test data is guaranteed to fit within the constraints given. You do not have to perform any extra checks to make sure of this fact.
- It is guaranteed that all the problems will be solvable with C++.
At the end of the contest, you may comment below to appeal a judging verdict. In the case of appeals, the decision(s) of DMOJ staff is final.
After the contest finishes, we'll have a optional feedback form we would like you to fill out .
|DMOPC '14 Contest 6 P1 - Core Drill||3p||67.4%||426||Editorial|
|DMOPC '14 Contest 6 P2 - Longest Tunnel||3p||66.7%||318||Editorial|
|DMOPC '14 Contest 6 P3 - Brotherly Sequence||5p||15.5%||103||Editorial|
|DMOPC '14 Contest 6 P4 - Kittan's Dilemma||10p||10.7%||70||Editorial|
|DMOPC '14 Contest 6 P5 - Attack on Anti-Spiral||25p||18.0%||13||Editorial|
|DMOPC '14 Contest 6 P6 - Nia and Dominoes||20p||8.7%||6||Editorial|