Hello, welcome to a DMOJ contest! We're glad to invite you to another contest! The contest duration is 3 hours. This round will be rated for all participants who submit at least once.
This contest will feature three problems of varying difficulties, and be on a full feedback model. Contestants are limited to 25 submissions per problem.
Unlike with other contests, there will be no partial credit for any of these problems. Furthermore, all problems will be graded with an
identical checker. The contest will follow the standard convention of having all lines terminate in a
Clarification requests for the contest must be routed through the clarification system provided on DMOJ, and not through other channels including but not limited to Slack. Furthermore, all clarification requests will be handled the way they normally are in IOI. Note that, in particular, clarification requests must come in the form of yes/no questions.
The contest consists of 3 questions with a range of difficulty. It is highly recommended to read all of the problems. You will have 3 hours to complete the contest. After the contest window begins, you may begin at any time. Your personal timer will start counting down, and you will be able to submit until 3 hours from when you started, or until the hard deadline, whichever comes first.
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.
- Remove all extra debugging code and/or input prompts from your code before submitting. The judge is strict — your output must match the judge output exactly.
- Do not pause program execution at the end. The judging process is automated. You should use
stdoutto perform input / output, respectively.
- It is guaranteed that all the problems will be solvable with C++. All problems have a time limit of at least 1.5x the reference solution, which is written in 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 our staff is final.
|Another Contest 1 Problem 1 - Binary String Operations||25||13.0%||12||Editorial|
|Another Contest 1 Problem 2 - Graphs||15||10.7%||13||Editorial|
|Another Contest 1 Problem 3 - Poutine||10||9.2%||27||Editorial|