By Nerevar, 9 years ago, translation, ,

Greetings to everybody.

I would like to invite you to take part in the next Codeforces competition, which will be held on 5th of December at 11:00 MSK. This competition will be a part of WCS olympiads (click here for details) and usual Codeforces round at the same time.

This competition, as all previous WCS contests, is sponsored by Yandex and ABBYY.

The official rules of the competition are ACM-ICPC rules. The duration of the competition is 3 hours.

Those who don't participate in selection to WCS will be displayed as "out of competition" in the result table. But everybody will get rating for this competition according to the merged result table.

This time the authors of the problems are Natalia Bondarenko and I. Thanks to Edvard Davtyan for his help in preparing the contest and to Maria Belova for translating problem statements.

Don't forget to register in order to take part in the competition. Good luck at the contest!

UPD: It will be available PDF versions of the statements during the round (you may print them):

UPD: The results of the contest. Congratulations to tourist, the winner of WCS contest, and to Petr, the winner of beta round #43.

UPD: Links to problem tutorials: A,C,F,G and B,D,E.

• +40

 9 years ago, # | ← Rev. 3 →   +6 The tasks were extremely nice. ThanksAfter the end of contest please provide me with test 17 of problem D.
•  9 years ago, # ^ |   0 And 24, please :)
•  9 years ago, # ^ |   0 24 is a big random test
•  9 years ago, # ^ |   +5 Чорт(
•  9 years ago, # ^ |   +3 Totally agree with you.Also want to know test #3 of E , that given +9 for me.
•  9 years ago, # ^ |   +3 Task E, test #3: 3 3 -3 -4 2 -1 2 -1 -4 -3 0 
•  9 years ago, # ^ |   0 Right answer is -11 (-5 +1 -7).
•  9 years ago, # ^ |   0 а можно второй тест?
•  9 years ago, # ^ |   0 3 3 -2 1 -5 4 -5 -4 -1 1 -1
•  9 years ago, # ^ |   0 А мне 21-й тест =) почему-то, сколько я не смотрел, решение на нем падало только у меня...
•  9 years ago, # ^ |   0 1000 12 16 100 1 16 1 52 1 55 2 3 2 2 2 1 1 97 1 53 1 29 2 9 1 2 1 91 2 8 2 12 1 35 1 92 1 62 2 15 2 11 2 7 1 14 2 16 1 93 1 67 1 97 1 33 1 98 1 23 1 60 1 66 1 8 1 87 2 32 1 62 1 45 2 25 2 23 1 29 2 29 2 38 1 34 1 71 1 24 2 31 1 21 1 77 1 67 2 26 1 6 2 30 2 24 2 46 1 77 2 28 1 13 2 21 2 35 1 6 1 100 1 10 1 56 1 37 2 62 1 52 1 70 1 95 1 14 2 64 1 91 1 68 1 72 2 41 1 76 1 29 1 86 2 43 1 82 2 45 2 60 2 65 1 58 1 44 2 27 1 1 1 57 1 70 1 87 1 16 1 1 1 58 1 85 1 58 1 22 1 13 1 81 1 57 2 58 1 22 2 93 1 41
•  9 years ago, # ^ | ← Rev. 2 →   0 Ой, ужас какой. А можно верный ответ к нему, а то вручную всё проверять очень долго?UPD. ответ можно не выкладывать. я взял верный код у тех, кто задачу сдал =)
•  9 years ago, # ^ |   0 and test #20:)
•  9 years ago, # ^ |   0 50 3 1 30 1 9 2 1 1 6 1 5 1 8 1 1 2 6 1 7 2 3 2 8 1 7 2 4 2 5 2 11 1 2 2 15 1 6 1 3 2 17 1 9 1 3 2 18 1 3 2 23 2 21 1 8 1 2 2 27 1 8 2 29 
•  9 years ago, # ^ |   0 Спасибо:)
•  9 years ago, # ^ |   +3 50 2 4 15 1 4 1 4 2 1 2 2 1 8 1 7 2 5 1 2 1 7 2 8 1 7 2 11 1 3 2 6 2 9 
•  9 years ago, # ^ |   0 Thanks
•  9 years ago, # ^ |   0 Can you please provide test 15 of problem D?
•  9 years ago, # ^ |   0 30 1 2 10 1 1 1 1 2 1 1 5 1 2 2 4 1 6 2 5 2 2 2 7
•  9 years ago, # ^ |   0 Thanks. Found my mistake.
 9 years ago, # |   +7 After all, I think it would be really nice if Codeforces publishes all test cases for all tasks after the contests.
•  9 years ago, # ^ |   +3 also small editorials would not be bad.
 9 years ago, # |   +4 Why is negative result allowed in task E? It doesn't make sense. It's also sad that the solution using iostream doesn't pass the TL, because usually at CF it's OK to use iostream and some of us got used to it:)But overall, the problems are very nice, thanks!
•  9 years ago, # ^ |   +2 I was also wondering whether a negative result is allowed or not. Had to ask this question through the system before submitting.
•  9 years ago, # ^ |   +5 According to the problem statement:"...Lara found a guidance note which said that to get hold of the treasures one has to choose some non-zero number of the first panels in each row of the table and put stones on all those panels to push them down."Given all values in the table are negative, you are forced to choose some negative values as answer.
•  9 years ago, # ^ |   +6 Yep, it's obvious. I got confused by "the maximum number of coins Lara can get" phrase though. The "number of coins" cannot be negative, assuming you treat coin as a physical object.
•  9 years ago, # ^ |   +3 "Lara found a guidance note which said that to get hold of the treasures one has to choose some non-zero number"What if I refuse to take the treasure? And how do you imagine getting a negative number of coins?
 9 years ago, # | ← Rev. 2 →   +21 It seems that problem G has wrong checker.There is no way this solution could pass sys-tests (but it got AC):    scanf("%d",&n);    printf("YES\n");   int s=0;    for (int i=0;i
•  9 years ago, # ^ |   +5 Most likely they do not check a couple of (1, N).
•  9 years ago, # ^ |   0 Not only that YES0 0-2 -1-2 -30 -1YES0 01 01 2-1 1YES0 01 02 13 2All of them passed the tests.
•  9 years ago, # ^ |   0 It seems true...For the test case n=4,I've got series of different answers for that among Accepted programs.
•  9 years ago, # ^ |   0 Yes, there was a terrible bug in the checker. Now it is fixed, and solutions that passed after the end of the contest were rejudged. Solutions that got accepted during the contest won't be rejudged.I apologize for that, and also for the bug in the first sample in the problem A.Thank you for that comment.
 9 years ago, # |   +5 Head was out when saw A's sample does not match but still some people managed to get AC. So waited.. then got the message to submit :( unfortunate lost 10min valuable time :(
 9 years ago, # |   +2 Could someone give me the test 6 for problem F?
•  9 years ago, # ^ |   +2 Are you take into account that all doors in second night must be closed?
•  9 years ago, # ^ |   0 I did all checks, but I couldn't check if all doors are closed. How to do this?
•  9 years ago, # ^ |   +3 3 3 31 22 33 1a 1 1 1b 2 1 3c 3 1 2b 1 1 2c 2 1 3a 3 1 1
 9 years ago, # |   +12 We should change the upper bound of the graph for tourist :)
•  9 years ago, # ^ |   +1 Check now, I've added the space for tourist growth :)
•  9 years ago, # ^ | ← Rev. 2 →   +11 if you can add "2400" and a line along  too. :)
 9 years ago, # | ← Rev. 2 →   0 I would like to know test number 14 of F. Can you please give it to me?----edit: fixed I am sorry for being so stupid ! I really am ... trust me ;)
 9 years ago, # |   0 Where can results for Codeforces Beta Round #43 be found? thanks
•  9 years ago, # ^ |   0
 9 years ago, # |   0 Can you please publish input for test 28 for problem E - Comb? thanks
•  9 years ago, # ^ |   0 Test 28 is a big random test with size 1000x2
 9 years ago, # |   0 how to solve problem E??
•  9 years ago, # ^ |   0 russian http://codeforces.ru/blog/entry/916
•  9 years ago, # ^ |   0 Denote F(i, j) as the maximum values that you can get from row 1 up to row i and at row i, you take ci = j. It is not hard to see that the following gives the correct value of F(i, j), for i > 1:F(i, j) = max{F(i-1, k)} + S(i, j)where k is ranged from 1 to j-1 if i is odd, j+1 to m otherwise.S(i, j) = sum of values at row i, from 1st column up to the jth column.If i = 1 then F(i, j) = S(i, j).Consider i > 2 as odd row. To calculate F(i, j) you don't need to rescan F(i-1, 1) ... F(i-1, j-1) to pick the maximal value, since to calculate F(i, j-1) you have found m = max{F(i-1, k)} for 1 <= k <= j-2, then in calculating F(i, j), max{F(i-1, k)} = max(m, F(i-1, j-1)) for 1 <= k <= j - 1. Hence in O(1) time you can determine F(i, j).For even i, you just do from decreasing j ,the trick is the same.Hence all F(i, j) can be found in O(nm) time.
 9 years ago, # |   +1 What is the test 8 for F?Could someone post it please?
•  9 years ago, # ^ |   0 4 5 3 1 2 2 3 2 4 1 3 1 3 a 1 2 4 3 b 1 0 c 4 3 1 2 5 a 1 2 4 3 b 1 1 5 c 4 2 1 2
 9 years ago, # |   0 And please gimme test 25 of task B.
•  9 years ago, # ^ |   +1 13 0 2 4 41 20 S XXL XXL L XXL M L M XXL M XXL L XXL XL M XL XL L L M
•  9 years ago, # ^ |   0 Thanks
 9 years ago, # |   +5 what is the test 11 for F?
•  9 years ago, # ^ |   +5 4 2 4 2 1 4 3 a 1 1 1 b 2 1 2 c 3 0 d 4 0 a 2 1 2 b 1 1 1 c 4 0 d 3 0
•  9 years ago, # ^ |   +5 thanks
 9 years ago, # |   +5 I think i have some trivial error in E. Could you give me test case 2, please?
•  9 years ago, # ^ |   +5 3 3 -2 1 -5 4 -5 -4 -1 1 -1
•  9 years ago, # ^ |   0 Thanks, my error was not in the coding, but in reading. Somehow, %lld does not work in Codeforce.
 9 years ago, # |   +5 What is the test 6 for F? Thanks...
 9 years ago, # | ← Rev. 2 →   0 Just to make sure you know:Links for tutorials B,D,E is not correct
•  9 years ago, # ^ |   +3 The url is http://codeforces.com/blog/entry/edit/916, delete the "edit/", http://codeforces.com/blog/entry/916 is useable.
•  9 years ago, # ^ |   +3 Thanks.