DMOPC '17 November Contest

Welcome to the second Don Mills Open Programming Competition of the 2017-2018 season!

The problem writers this time are Kirito and r3mark.

If this is your first time participating in the DMOPC, you can learn about our system here.

This round will be rated for all participants who submit at least once.

Before the contest date, you may wish to check out the tips and help pages.

This contest will consist of 6 main problems, the difficulty of which may range anywhere from CCC Junior to CCO level.

Some problems offer partial marks in the form of subtasks. If you cannot solve a problem fully, we encourage you to go for these partial marks.

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 (noon EDT of Nov. 15th), whichever comes first.

Additionally, this contest will feature a 7-th problem (Problem 0) for students who are just getting started with programming.

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 not guaranteed that the problems will be in order of increasing difficulty. Reading all of the statements is recommended.
  • 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.
  • 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.

Problems

Problem Points AC Rate Users Editorials
DMOPC '17 Contest 2 P0 - Secrets 3 33.4% 437 Editorial
DMOPC '17 Contest 2 P1 - 0-1 Knapsack 3 29.1% 380 Editorial
DMOPC '17 Contest 2 P2 - Balance 5p 16.8% 331 Editorial
DMOPC '17 Contest 2 P3 - Bad Bunnies 10p 25.5% 407 Editorial
DMOPC '17 Contest 2 P4 - Mimi and Dictionary 12p 22.0% 86 Editorial
DMOPC '17 Contest 2 P5 - Game 20p 15.3% 9 Editorial
DMOPC '17 Contest 2 P6 - Lazy Days 15p 15.2% 35 Editorial

Comments


  • -1
    Ninjaclasher  commented on Nov. 16, 2017, 12:23 a.m.

    When are the rankings going to be added?


  • 4
    radoslav11  commented on Nov. 15, 2017, 3:15 p.m.

    I'm pretty new at DMOJ, so I was curious if the solutions/hints/participant's solutions to the problems will be available after the end of this contest (It wasn't written anywhere and I still don't know how to solve P5). So will they be published? Thanks in advance.


    • 3
      r3mark  commented on Nov. 15, 2017, 3:25 p.m.

      Once the editorials are written (which should be by tonight), they will be provided in a link on each problem page. They will also be available on this page in a table. I'm glad you enjoyed the problems!


  • 4
    jkguipqnjcy49979693  commented on Nov. 15, 2017, 4:44 a.m. ← edited

    I learned today that sometimes one should actually read the problem before trying to solve it.

    Great contest btw!

    (I predict that REEmark is d)

    EDIT: I think that this contest already broke the record for most number of rated (submitted at least once) participants. Congrats!


  • 0
    bradypotter16  commented on Nov. 15, 2017, 2:08 a.m.

    Any clarification on P6 - Lazy Days when it states "Maximizes the Minimum?"


    • 0
      r3mark  commented on Nov. 15, 2017, 2:16 a.m.

      I've posted a reply on the problem page. In the future, please ask questions on the problem page (which is private), not on a public page.


  • 3
    cynical  commented on Nov. 15, 2017, 12:55 a.m.

    windowat solved p0-p4 in a 1 min and 46 secs?