Happy Hackers Programming Challenge 1
Welcome to the first Happy Hackers Programming Challenge (HHPC1)!
The problem setter is
.Thanks to
, , , , , and for testing, feedback, and assistance with the problems!Special thanks to
for helping organize and review the contest!This contest will be rated for all participants with a rating under 2600.
Before the contest date, you may wish to check out the tips and help pages.
This contest will consist of 6 problems, the difficulty of which may range anywhere from CCC Senior to CCO level.
You will have 3 hours to complete the contest. After the contest window begins, you may begin at any time. Once you enter the contest, 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 (00:00:00 EST of February 2nd), whichever comes first.
After joining the contest, you proceed to the Problems tab to begin.
Here are the parameters of the contest:
- Some problems offer partial marks in the form of subtasks.
- Ties will be broken by the maximum submission time that increased score with no penalties.
- A maximum of 50 submissions will be allowed per problem.
- Scoreboard will be hidden, until your window is over. Divulging the contents of the scoreboard to participants who have not finished their window is an offense, the punishments of which are listed below.
- Problems will be approximately increasing in difficulty, and will all have full feedback. Reading all of the statements is recommended.
- Checkers: unless otherwise specified, standard.
- Interactors: unless otherwise specified, assume that all interactors are not adaptive.
- Rated for opening the contest. Being able to read the problems will cause the contest to be rated.
- It is guaranteed that all the problems will be solvable with C++, and all time limits will be at least 2x the runtime of the reference solution.
We have listed below some advice as well as contest strategies:
- 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 stdin / stdout to perform input / output, respectively.
- Python users are recommended to use PyPy 2/3 over Python 2/3 when submitting.
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 Discord and 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 rating being impacted negatively. Such behavior includes, but is not limited to:
- Divulging the contents of the scoreboard to participants who have not finished their window.
- Registering for the contest with at least two accounts.
- Participating in the contest with an account that is not your primary account.
- During the contest window, talking about the contest in more detail than answering a yes/no question about whether one participated in the contest. This includes, but is not limited to, posting spoilers about the contest and public speculation of the contest.
- Attempting to exploit bugs in the platform to subvert the constraints of the contest.
- Attacking the judge infrastructure, other contestants, or contest personnel within or after your window.
Punishments may include performance being unrated or, for more serious infractions, being forcibly ranked at the bottom of the scoreboard.
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.
Problems
Problem | Points | AC Rate | Users | Editorials |
---|---|---|---|---|
HHPC1 P1 - Yielding the Longest Substring | 5 | 22.6% | 226 | Editorial |
HHPC1 P2 - Yuniformity Challenge | 10p | 13.0% | 129 | Editorial |
HHPC1 P3 - Yonder Ridge | 12p | 11.7% | 33 | |
HHPC1 P4 - Yet Another A+B Problem | 10p | 12.2% | 120 | Editorial |
HHPC1 P5 - Yunity Grouping Objects | 17p | 34.9% | 14 | |
HHPC1 P6 - Yarn Street's Strategic Shopping | 20p | 8.4% | 5 |
Comments