Hello everyone. If you participate in KPI-Open 2013 held now in Kiev I would like to talk about problems and their solutions in this post.
Our team was very unlucky today and we solved much less than we usually do (just 2 problems but with the fastest time). We had some strange bug in problem C. Our solution was based on storing coordinate shift to eliminate loops. We had WA on pretest number 8. Also we failed to do problem F, again because of not found bugs, but I think the idea was correct.
So tell about your solutions and share your ideas here.
Has anyone solved problem D?
Are problems published anywhere online?
They will be published here http://kpi-open.org/ a little bit later (I think after the second round of the contest or possibly tomorrow)
Посоны как решать Е?
There was a rejudge for problem D, we and MIPT got AC)
P.S. About F: Did you change a distantce to the answer, when you put the smallest index to the first place. Try test:
3
1 2 1
2 3 3