Welcome to the first Trudeau Logic Evaluation of the 2016-17 school year!
The Trudeau Logic Evaluation this year will be Pierre Elliott Trudeau's first monthly contest series.
The problem writers/testers of this round are ZQFMGB12, d, and nathanl3.
The TLE will be a 3-hour virtual contest, which will allow contestants to participate in any 3-hour window between 12:00 PM EDT and 11:00 PM EDT on September 21, 2016. 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.
Due to the large contest time window, we will be using a pretest/systest format in order to prevent cheating. On problems 4-6, when you submit, you will receive your result on some of the test data, called preliminary tests (pretests). After the contest, we will rejudge all solutions on the complete set of test data, and that will determine your final score. Note that getting AC on pretests does not ensure that you will pass system testing.
The pretests will be weak, so be sure to check your algorithms' correctness and time complexity! The pretests should be treated as sample cases and/or cases from easy subtasks.
This contest will be rated for all participants who submit at least once.
The contest consists of 6 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 difficulty of a problem may be anywhere from CCC Junior to CCO level. 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 (September 21, 11PM EDT), 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
stdoutto 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.
|TLE '16 Contest 1 P1 - Buying Paper||3p||21.3%||78||Editorial|
|TLE '16 Contest 1 P2 - Heavy-Light Decomposition||5p||19.5%||46||Editorial|
|TLE '16 Contest 1 P3 - Joey and Chemistry||7p||13.3%||27||Editorial|
|TLE '16 Contest 1 P4 - Microwaves Again!||12p||27.0%||32||Editorial|
|TLE '16 Contest 1 P5 - Battle Plan||17p||18.0%||19||Editorial|
|TLE '16 Contest 1 P6 - A Very Normal Test||25p||14.6%||12||Editorial|