School Team Contest #2 (Winter Computer School 2010/11)
By natalia, 15 years ago, In English
Good day to everybody!

I am glad to invite you to participate in the next round of the series of winter programming school olympiads, that will be held on the 6th of November at 14:00 MSK.

The contest is official for school teams, and unofficial and not rated for everyone else. Remember, that if you have a school team, you must register all the participants for the series, if you haven't done it yet.

The duration of the contest will be 5 hours, and the rules are standard ACM ICPC.

The problems were prepared by me, Dmitry Matov, Polina Bondarenko, Mikhail Mirzayanov, and also by Maria Belova, who translate them to English. We all hope that the contest will be interesting for you to participate.

Good luck!

UPD. Statements in PDF: russian version and english version. The statements will be available when the contest starts. 

The contest is over. The winner is Gennady Korotkevich who solved 9 problems for less than 3 hours. Results are available. 

Tutorial:
  • Vote: I like it
  • +23
  • Vote: I do not like it

15 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it
Good luck to all!
→ Reply
15 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Can anyone tell me the test 22 of problem H? Thanks so much!

→ Reply
15 years ago, hide # |
 
Vote: I like it +5 Vote: I do not like it
fascinating...someone passed problem G using a brute-force algorithm!
→ Reply
15 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it
When I submitted problem H by Pascal, I got "Compilation Error". After changing from "int64" into "longint", I got WA on test 15. What's wrong with Pascal compiler?
→ Reply
15 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it
Could anyone give me the input and output for problem h #1 test case?
→ Reply
15 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it
Hi,
I'm getting MLE on problem G, test 56. I have reduced memory consumption at least by a factor of 6. But there is no change and approximately at the same running time I get this error. Any help?
→ Reply
  • 15 years ago, hide # ^ |
     
    Vote: I like it 0 Vote: I do not like it
    Correct solution for this problem requires O(n log n) memory that is not too much. See accepted solutions of other participants (using ~ 50 M). If you are getting MLE, I can suppose that your solution probably use O(n^2) memory, or it goes to infinite recursion.
    → Reply