TLE '17 October Contest


Welcome to the second Thorndeau Logic Evaluation of the 2017-18 school year!

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

The TLE will be a 3-hour virtual contest, which will allow contestants to participate in any 3-hour window between 4:00 PM EDT and 11:59 PM EDT on October 27, 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.

The contest will use a pretest/systest format for problems 4-6. When you submit to these problems, you will only be judged on some of the test data, called pretests. After the contest, all submissions will be rejudged on the full test data. Pretests typically contain weak test data and do not include maximum or corner cases.

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 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. It is highly recommended to read and attempt 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 (October 27, 11:59 PM 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 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.



Comments


  • 12
    Ninjaclasher
     commented on Oct. 28, 2017

    When will the problems be released?


    • 6
      Tearful
       commented on Oct. 29, 2017

      Absolutely great question.


  • 1
    floatingfowl
     commented on Oct. 28, 2017 edited

    Editorials show "Could not find a problem with code -------"


  • 5
    _____
     commented on Oct. 28, 2017 edited

    Nvm


  • 9
    cynical
     commented on Oct. 28, 2017

    eric574 21 second submission on p1?


  • 0
    Tydysy
     commented on Oct. 27, 2017 edited

    Hi , in the problem P6 : "(x+1,y)(x+1,y) and (x+1,y+1)(x+1,y+1) contain pillars, then Fax can move to (x,y+1)(x,y+1) " Is this correct?