Mock CCC '19 Contest 2 Senior

Hello, welcome to a mock CCC! Here are the parameters of the contest:

  • Contest duration: 3 hours.
  • Number of problems: 5, full feedback. The problems follow the CCC format of being worth 15 marks each. Some problems have explicit subtasks.
  • Not 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 \n character. This means that failure to properly end lines with \n will result in a Presentation Error verdict.

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.

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

The contest consists of 5 questions with a range of difficulty from CCC Senior 1 to CCC Senior 5. 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 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 our staff is final.

Problems

Problem Points AC Rate Users Editorials
Mock CCC '19 Contest 2 S1 - Tudor's Double Doors 3p 10.8% 225 Editorial
Mock CCC '19 Contest 2 S2 - Tudor Puts A Goat On A Rope 3p 29.4% 214 Editorial
Mock CCC '19 Contest 2 S3 - Tudor Tallies Triangular Totals 10p 5.4% 62 Editorial
Mock CCC '19 Contest 2 S4 - Tudor Walks Among the Goats 25p 6.8% 8 Editorial
Mock CCC '19 Contest 2 S5 - Tudor Takes Pictures of Goats 15 6.8% 14 Editorial

Comments


  • -3
    kate_all  commented on Feb. 13, 2019, 3:49 p.m.

    My solution for question 2 was correct, I graphed it, calculated it with and without my program, and still got 4.2 for input 2. Can you please recheck the program without input 2 for problem 2?


    • 3
      wleung_bvg  commented on Feb. 13, 2019, 4:19 p.m.

      Your solution is incorrect. For sample 2, the point on the rectangle that is closest to the fence post is (6, 2). The distance from the fence post (6, 0) to the point (6, 2) is 2.000.