UPD2: Tomorrow (July 31st, Sunday) at UTC 10:00 there will be an online mirror of Yandex.Algorithm final round.
Everybody are invited to participate! You may discuss problems in comments after the contest ends.
UPD3: The online mirror has finished! Congratulations to ImBarD aka Vercingetorix for taking the first place.
We're glad to remind you that tomorrow, July 29th, at 9:00 AM UTC there will be the Final Round of Yandex.Algorithm 2016 in Minsk. List of finalists and elimination stage results are available on Yandex.Algorithm website.
You can watch follow the news on final round at Yandex.Algorithm website. Want to solve final round problems? On Sunday, July 31st, at 10:00 AM UTC there will be a mirror of the competition. Everybody can participate in it, solve the same problems as finalists and try his or her best on the finals' problemset.
The final round has been prepared by authors of previous stages of Yandex.Algorithm: Endagorion, Romka, Chmel_Tolstiy, GlebsHP, snarknews, Gassa and your humble servant. We believe that problems are various and interesting.
In this post after the cut I'll write some comments about what happens in the contest trying not to spoil any important details (we don't want to provde help or to ruin contest for any of the participants, isn't it?).
See you tomorrow!
Congratulations to the winners!
- Egor winning 300 thousands of rubles.
- W4yneb0t winning 150 thousands of rubles.
- rng_58 winning 90 thousands of rubles.
Final results are available here. The competition is finished, everybody are invited to participate an online mirror on Sunday!
-0:25: Competitors have already set up their laptops and are waiting for the competition to start. There are six finalists participating onsite this year: Errichto, Egor, eatmore, tourist, vepifanov, aid. Also there are some guests from Belarus, in particular Belarus national team for IOI 2016.
-0:10: Here are great prizes the competitors will fight for.
0:00 The Finals has started! There are six problems that are shuffled (i. e. do not follow in the order of difficulty).
0:07 Participants start coding. I'm going to tell a bit about problems they are trying to solve (when it happens).
0:25 Contestants opened problems C, B (in blind), A and F very fast: the first to solve problem C was taken by Um_nik and this is the most popular problem at this moment. It is about swapping people in order to make them seat in a certain manner. Looks like it will be an easiest problem to solve.
0:39 Problem A is very unusual: it looks like a graph problem, but the graph is fixed and does not depend of the input data. Also it is related to the beatuiful National Library of Belarus where the competition is held:
There are currently two contestants in the top with three problems, but there is also eatmore who has two problems, but both of them are submitted in blind mode.
0:48 Problems B and F both seem to be easy, but standings show that they are trickier then it looks like. Success rate (considering only open submissions) for both of them is lower than 50%.
1:00 There are only 40 minutes left. Egor takes the lead with four "easier" (according to statistics, of course) problems. There is also Errichto who submitted problem E in blind mode. If he succeeds to solve an "easy" problem F and a "medium" problem A, he will take the lead.
1:25 It is only 15 minutes till the end of the contest and still no submissions for problem D. Looks like all the leaders with 4 problems are working on the problem E inspired by Errichto's blind submission. Though, I don't actually know that :)
1:40+ The competition is finished. The final results are available here