Welcome to the contest of Saratov State U on Petrozavodsk Winter Training Camp 2012-2013. This contest was prepared with diligence and love by jury team of ACM-ICPC NEERC Subregional (Saratov) Contest. Here is the complete list of writers:
Thanks to all of them!
All the authors invite you to take part in the contest virtually in Gym, if:
- You didn't take part in it previously
- You (or your team) is high skilled that you will take part (or took part) on ACM-ICPC World Finals or other high-level competitions. The problemset seems to be hard for not experienced participants.
Hope, you will enjoy the contest!
Contest link: 2012-2013 Petrozavodsk Winter Training Camp, Saratov SU Contest.
What limits were given to the problem C in Izhevsk? Because of the fact that it was solved by two teams with level of skill compared to ours, it seems for me that they were significantly lowered.
There were some problems with wrong time limit. It is fixed already for upsolving.
Stepanenko DStepanenko, Klenov DmitryKlenov
Thanks, fixed.
Excuse me. Problem K. What is the answer for this test ? 6 1 2 3 4 4 1 ? 3 2 5 6
I suppose, it is 2.(If the order is 5 2 6) Thanks.
problem J Tourist Problem: I got WA on test case 6 28 times and can't find any bug... Is there any tricky data?
Here is the link:
http://codeforces.com/gym/100162/problem/J
there must be exactly one tree inside the polygon to be used as a pole to maintain the tent
what does it mean? I have thought it means we can choose another point in the convex hull, and count this number, but I have found it seems not mean this.
waste of 29 submit :(
update:: 9888ms AC :)
Is there any editorial for this contest??