TLE '16 February Contest (Mock CCC) Senior Division

Welcome to the sixth Trudeau Logic Evaluation of the 2016-17 school year!

The problem writers/testers of this round are ZQFMGB12 and d.

The TLE will be a 3-hour virtual contest, which will allow contestants to participate in any 3-hour window between 9:00 AM EST and 11:59 PM EST on February 20, 2017. Of course, it is forbidden to use two accounts to participate, and it is also forbidden to discuss the problems and/or their solutions with other people during the entire contest period.

This contest will differ from the other TLEs in format. In preparation for the Canadian Computing Competition (CCC), for this month, the TLE will follow the CCC format. This means that there will be two divisions, 5 distinct problems per division, 15 points per problem, and no system testing.

This contest 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.

The contest consists of 5 questions with a wide range of difficulties, and you can get partial marks for partial solutions in the form of subtasks. If you cannot solve a problem fully, we encourage you to go for these partial marks. The problem difficulty is intended to reflect the difficulty of the CCC Senior. 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 (February 20, 11:59 PM EST), 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 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 our staff is final.

Problems

Problem Points AC Rate Users Editorials
TLE '16 Contest 6 (Mock CCC) S1 - Writing the CCC 5p 36.3% 512 Editorial
TLE '16 Contest 6 (Mock CCC) S2 - Paper Stapling 10p 6.1% 42 Editorial
TLE '16 Contest 6 (Mock CCC) S3 - Hyper Fax 15p 17.1% 159 Editorial
TLE '16 Contest 6 (Mock CCC) S4 - Bubble Sort 25p 6.4% 12 Editorial
TLE '16 Contest 6 (Mock CCC) S5 - Toll Routes 20p 4.0% 28 Editorial

Comments


  • 4
    bobhob314  commented on Feb. 20, 2017, 4:55 p.m.

    Do we have confirmation from Fatal that this is roughly the difficulty of this year's CCC?


    • 2
      r3mark  commented on Feb. 20, 2017, 7:13 p.m.

      d has stated that this is approximately the difficulty of S2 to S6 which doesn't really exist but whatever.


      • 1
        bobhob314  commented on Feb. 20, 2017, 10:25 p.m.

        Thanks r3mark, I hope we both do well, both today and at the CCC!