Hello, welcome to a DMOJ contest! We're glad to invite you to another contest! Here are the parameters of the contest:
- Contest duration: 3 hours.
- Number of problems: 4, full feedback, with no partial credit. The difficulty range has been made more generous on the easy end.
- Rated for opening the contest. Unlike with other contests which require making a submission for the contest to be rated, opening the contest and being able to read the problems will cause the contest to be rated.
- Scoreboard will be hidden.
- Number of submissions allowed per problem: 50.
- Checkers for problems: Unless otherwise specified,
identical. The contest will follow the standard convention of having all lines terminate in a
- Testers for this contest: , , and .
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.
Due to rampant issues with cheating on contests that has happened recently, any suspicious behavior during the contest window may result in your performance being unrated. Such behavior includes, but is not limited to:
- Registering for the contest with at least two accounts.
- During the contest window, talking about the contest in more detail than answering a yes/no question about whether one participated in the contest.
- Attempting to exploit bugs in the platform to subvert the constraints of the contest.
The contest consists of 4 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++ and uses this template for I/O. If you're unable to see the template, you must solve this problem.
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 3 Problem 1 - Diverse Arrays||7||20.0%||85||Editorial|
|Another Contest 3 Problem 2 - Camelot||15||12.5%||38||Editorial|
|Another Contest 3 Problem 3 - Lexicographically Largest Common Subsequence||7||21.4%||38||Editorial|
|Another Contest 3 Problem 4 - Range Updates and Range Queries||15||34.2%||42||Editorial|