By MikeMirzayanov, 10 years ago, translation,

School Team Contest #3 (Winter Computer School 2010/11) will be held on November 13 at 11:00 (UTC). This is the final team event of the series, and we will be glad to see both permanent participants and new teams.

The contest has been prepared by me, Artem Rakhov, Nikolay Kuznetsov and Ivan Fefer. All of us will soon go the ACM-ICPC regionals in St. Petersburg, and now the guys have to combine the preparations for the semifinals with writing problems for you. Special thanks for the translation of problems to Maria Belova.

Everyone can take part in it out of the competition (informal). Make up your mind :)

We decided to sum up contest results using the ITMO rating system, according to which team gets a score from 0 to 200 per contest. It will be used two best participations out of thee possible. I will not reveal secrets, saying that Gennady Korotkevich showed great results and secured the victory ahead of schedule!

Good luck in the upcoming competition, MikeMirzayanov and stern, but fair jury.

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

• +13

 10 years ago, # |   0 Will this be rated for everyone?
•  10 years ago, # ^ |   +1 No, take part just for fun
 10 years ago, # |   -8 Good luck to all
 10 years ago, # | ← Rev. 2 →   +6 I can't register. When I click on register I see this:It's only 28 minutes till startPlease help!
•  10 years ago, # ^ |   +1 Try again
•  10 years ago, # ^ |   +1 I added our team, Thank you
•  10 years ago, # ^ |   0 Thanks Hamed , And thanks Mike Mirzayanov.
 10 years ago, # |   0 Now that team contests have ended, Is there any other use for "TEAMS" ?
 10 years ago, # |   0 I can't understand this sentence "The one-colored houses should not stand consecutively" in < prime problem > Can anyone explain it? Thank you very much.
•  10 years ago, # ^ |   +2 Consecutively : 1 1 1 3 3 3 2 4 4 5 5 5 5not consecutively: 1 1 3 3 1 1 2 1 1 2 3 2 1
 10 years ago, # |   0 Can someone explain to me how to do Question B (School)?
 10 years ago, # |   0 in probelm A,what is test 8?
 10 years ago, # |   -11 What is test 10 in problem F? I have got wrong answer on test 10 several times...
•  10 years ago, # ^ |   -8 I suggest that test 10 is 2 2.This problem is really good problem. I tried several times and finally get accepted :)
•  10 years ago, # ^ |   0 Apparently the answer to 2 2 is -1? But it is possible to bring everyone over in 5 moves!Let (G1,W1) (G2,W2) represent the goats and wolves on both sides of the river.(2,2) (0,0)(1,1) (1,1)   // 1(2,1) (0,1)   // 2(0,1) (2,1)   // 3(0,2) (2,0)   // 4(0,0) (2,2)   // 5Unless I misread the question somehow ...
•  10 years ago, # ^ |   0 After the first move, the sheep on the left bank will be eaten.
•  10 years ago, # ^ |   0 But I think the problem statement says"If in one place (on one of the banks or in the boat) the wolves happen to strictly outnumber the goats, then the wolves eat the goats and Vasya gets upset."After the first move, there is 1 goat and 1 wolf on the left bank. Why will the goat get eaten? :(
•  10 years ago, # ^ |   0 Oh, I made a mistake. When m=2, the boat just can carry Vasya and an animal. (Am I right now?)
•  10 years ago, # ^ |   0 Wrong again = =When n=2, the boat just can carry Vasya and an animal.
•  10 years ago, # ^ | ← Rev. 2 →   0 Ok, I think there is some ambiguity with this statement:"The boat can hold n animals and Vasya, in addition, he is permitted to put less than n animals in the boat."There seems to be a contradiction. Firstly it says that the boat can hold n animals. Then it is stated that it can only hold at most n-1 animals. I guess I interpretted it wrongly and thought that the boat can hold at most n animals.However, if that is the case, how can the input 3 2 return 11? You can only bring 1 animal over every time, and you need to bring at least 1 animal back. That means that the net movement of animals to the other bank is always 0.Also, something seems strange. I think I can say that if the input is (m n) and the answer is -1, then for all input (k n) where k > m, the answer should also be -1. However, the answer for 2 2 is -1 and the answer for 3 2 is 11. There seems to be something wrong.Did I misread the question somewhere?
•  10 years ago, # ^ |   0 When Vasya swims on the boat from one shore to the other, he must take at least one animal to accompany him. Maybe this tip is useful.It seems that I didn't understand the problem before. I saw tourist output -1 for 2 2 and then I output -1 for 2 2.Sorry for my mistake.
•  10 years ago, # ^ |   0 I still cannot find the mistake of the moves you gave for test 2 2.
•  10 years ago, # ^ |   0 Aww :(Do you know who the setter of this problem is? Maybe we can ask him?
•  10 years ago, # ^ |   0 Maybe we can ask tourist.
 10 years ago, # |   +5 I sent him a message here, but he did not reply :(
•  10 years ago, # ^ |   0 I'm for your opinion...that the answer for m=n=2 should be 5.Maybe we all misunderstand something in the problem description?
•  10 years ago, # ^ |   0 Does anyone know who set this problem? Thanks
•  10 years ago, # ^ |   0 Seems that two of the problemsetters of this round are Fefer and RAD I don't see what's wrong with your solution either.
•  10 years ago, # ^ |   0 It seems my solution didn't consider transporting m goats at once, now it outputs 5 for 2 2 and receives WA 10, so the 10th test case is probably wrong.
•  10 years ago, # ^ |   0 Fixed and rejudged. Fortunately, compelete solutions from the official participants didn't appear. So the mistake didn't affect the rating. Attempts with the verdict OK have not been rejudged. Sorry for a long delay, but we have not noticed this thread comments. Thank you for care.
 10 years ago, # |   0 what is the means of problem H. Road Problemfor input 2:4 41 22 32 43 4why need to add a new edge 1 3from road 1 2 go to other roads there is already 2 diffrent paths...
 » 9 months ago, # | ← Rev. 2 →   -18 Where are the editorials for this contest ? I can't understand how to solve D by looking at the accepted submissions of others. can anyone please help ? Is it some kind of standard technique ?