MLE '18 Contest #8
Welcome to the eigth Mackenzie Logic Evaluation (MLE)!
This contest consists of problems, the difficulty of which may range anywhere from CCC Junior to CCO level.
You will have the hours to complete the contest. For every minutes you submit before the end of the contest, there will be a point bonus.There will also be a point bonus for fully solving on the first try.
The problems will be in a random order of difficulty. Therefore, you are recommended to read all the problems.
Before the contest date, you may wish to check out the tips page.
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++.
- Read carefully, and try to attempt all the problems. They may not be as hard as they seem and you may get partial points!
At the end of the contest, you may comment below or on Discord to appeal a judging verdict. In the case of appeals, the decision(s) of staff is final.
Good luck.
Problems
Problem | Points | AC Rate | Users |
---|---|---|---|
A Subarray Problem | 10 | 22.7% | 9 |
An XOR Problem | 20 | 4.1% | 2 |
A Base Problem | 5p | 14.1% | 53 |
Graph Theory 5 | 7 | 43.8% | 6 |
A Subarray Problem 2 | 5p | 30.9% | 32 |
Comments