### dolphinigle's blog

By dolphinigle, 9 years ago, ,
Welcome to Codeforces Beta Round #87!

The mysterious author of today's match (which turns out to be me) have prepared seven problems for you (five in each division). Since I can't spoil you any of the problems yet, for now I can safely say that I like all of today's problems. The problem statements are wonderfully crafted (and translated) with the help of both RAD and and they are now very easy to read. My hope is that you will like them as well :).

There will be .png images in some problems, so make sure your browser can support them. You may want to check if you can see the image in the Time to Raid Cowavans problem (authored by Alex_KPR).

And also a warm thanks to it4.kp for testing the problems (for the fourth fifth time I might add - he tested 4 of my SRMs already :) ) together with RAD, and to MikeMirzayanov and the entire Codeforces team for the great system and this opportunity! Indeed it is through this website that I receive my current internship offer :).

So from Kraków I wish everyone and the Codeforces' server good luck and stay strong :).

===

The match has ended! Thank you for participating - I enjoyed it :). Here's the Editorial for this match.

The top three of the Division1 solves all five problems! They are followed by al13n and kcm1700 who solved 4 problems in approximately one hour. Congratulations!

Division 1:
2. Petr
3. Egor
4. al13n

In division 2, we have exactly 5 persons who solved all 5 problems, the fastest solved all five problems within 1 hour 4 minutes! Congratulations!

Division 2:
1. kyrka
3. Skird
4. ts10

I hope I can author other set next time here. Till we meet again.

Final rants

If I could turn back time, I would change the following:
1) Swap problem D1-D and D1-E
2) modulo 1,000,003 becomes modulo 1,000,000,007
3) N^2 solutions means N >= 4,000
4) Time limit should be made for Java, not Python...

Lesson learned. And the N^3 solutions which pass turn out to be beautiful after I see them (all of them implements different algorithm after I read them more carefully). Not to mention there's 3 passing N^2 solutions. Okay, I'm content now :) - apologies for my rants yesterday.

=== stale rants below ===

Oh, after the coding phase, you may want to visit this post again.

Guess what? It's starting! Rawr! I'm honored that it broke the maximum number of participants so far - thank you guys :).

Now that the match is over...
I owe division 2 apologies for making D2-D too easy. Sorry - I didn't see that coming.
Anyway, while you're busy waiting for scores to pop up in your respective division summary, here you go! Editorial for this match.

I don't know, I hope all N^3 solutions in D fail. Otherwise I owe you guys another apology. I'll be more evil with constraints next time :)
Okay, so a big apology from me for letting a N^3 solutions to pass D1-D. It didn't cross my mind that N^3 = 2000^3 would run under 2 seconds. I'll make sure not to make things like this happen again in my matches :( - 5000 here I come.

• +5

 9 years ago, # | ← Rev. 2 →   0 Since "from Krakow now", could you please include in future contests some problems about Ijon Tichy and possibly other Stanisƚaw Lem's heroes? ;-)
•  9 years ago, # ^ |   0 You're too late, this is my last month in Krakow :)
•  9 years ago, # ^ |   0 I believe such a mighty problemist could create two or three contests during one month! Ok, it was almost joke, never mind! :-)
 9 years ago, # |   0 Thanks for mentioning me, but I didn't deserve it this time.The only thing I did was comparing the difficulty of two problems. I didn't even read the other ones. So, this is definitely not testing :)
 9 years ago, # |   0 Will the strange illustrations appear!?
 9 years ago, # | ← Rev. 3 →   0 In what SRM's you were a problemwriter?
•  9 years ago, # ^ |   0
•  9 years ago, # ^ |   0 га га
 9 years ago, # |   0 Thanks a lot. Hope to have a great contest (and great translations :D)
 9 years ago, # |   0 And again, I'd compete, if time of start of round was later, then standard 19:00.
 9 years ago, # |   0 Toastman may appear in the statements.
•  9 years ago, # ^ |   0 Maybe even Toastwoman. :)Though, on a serious note, it seems doesn't reuse his characters too often, so I would expect some new heroes.
•  9 years ago, # ^ |   0 So sorry to disappoint you ;)
 9 years ago, # |   0 err.. Excuse me but what is the SRMs by the way? (I'm really sorry if it's inappropriate to ask like this)
 9 years ago, # |   0 I'd like to compete, but its right on my lunch time.
•  9 years ago, # ^ |   0 Damn auto correcthttp://www.codeiforces.com
•  9 years ago, # ^ |   0 lunch still there tomorrow :p
 9 years ago, # |   0 I tried to submit a solution for practice in past contest but it was taking so long for judging.. I'm afraid this will happen in contest also.. Any solution for this, admin ?
•  9 years ago, # ^ |   0 I think this happens because the server is rebooting before each contest. I may be wrong though.
 9 years ago, # |   0 Your problems are usually nice and make the competitors think more rather than just coding. I was eagerly waiting for you to be an author of one the codeforces round. Thank you dolphinigle
 9 years ago, # |   0 Thank you. Real nice pictures by the way. :)
 9 years ago, # |   0 In all problems today we should return only one number (both Div1 & Div2) (:
 9 years ago, # |   0 I love problemset! :)
 9 years ago, # |   0 Clear statements, useful pictures, and nice problems! I enjoy this match  very much. Thanks,
 9 years ago, # |   0 Great problemset. I'm just wondering about the solution of Div 1 C, that kind of tasks always confuses me.
•  9 years ago, # ^ |   0 Could you please see Prob B of DIV 2 .
 9 years ago, # |   0 How to solve DIv2 prob 2. I have no clue whats the best way ?
•  9 years ago, # ^ |   0 plz see the author's editorial :D
•  9 years ago, # ^ |   0 The answer is the number of wolfs, which have at least 1 neighbour pig. Since there is only one step in the task, and a wolf can eat at most one pig, it doesn't matter which to choose, and because no pig has more than one neighbour wolf, there can't be a fight over the same pig between multiple wolves as well.
•  9 years ago, # ^ |   0 Ahh..  did not notice that thing and whole time I was thinking , whether by mistake I have opened division 1 problem B.
 9 years ago, # |   0 Despite the fact that I wrote bad today, this contest seems me really good: there was solved and interesting problem. In my opinion, it would be great to see similar contest every time.
•  9 years ago, # ^ |   0 Не могу не привести цитату из "Криминального чтива": English, ****! Do you speak it?!Но вообще согласен, контест действительно хороший и интересный.
•  9 years ago, # ^ |   0 Макс, откуда ты знаешь??? Ты ведь его не писал.
•  9 years ago, # ^ |   0 Читал условия, смотрел решения.
•  9 years ago, # ^ | ← Rev. 3 →   0 На самом деле, часто впечатления от контеста после того, как прочитал условия и решения, сильно отличаются от тех, которые были бы, если бы прочитал условия и после этого 2 часа решал:)P.S. после публикации сообщения язык поменять никак?.. Жаль.
•  9 years ago, # ^ |   0 Безусловно, но не всегда же удается написать тот или иной контест.
 9 years ago, # |   0 The editorial available right after the match is by itself a reason to call it wonderful.Nice problems, too.Kudos to dolphinigle and to the others problem setters!
 9 years ago, # |   0 The best thing I liked about the contest was the inages supporting the test cases.Made easier for us to visualize then..Good contest overall:)
•  9 years ago, # ^ |   0 Yep, images were nice and cute :3But anyways, after I read the problem pictures didn't make much sense to me, because problem text was composed that good.
 9 years ago, # |   0 I liked round, because there were not any longlongs, and output was as easy, as possible - one number.Liked statements, they were simple, understandable and short. Thanks to writer
 9 years ago, # |   0 Imo pretests for Div1 D are too weak. Wasn't easy to solve it, and a few seconds before the end I understand that I've missed some special case.
 9 years ago, # |   0 Damn, I didn't know that was going to be the author today. Otherwise I wouldn't have missed it.
 9 years ago, # |   0 B: I misread the man in the problem can always flip his direction.C: I misread the top-most side and the bottom-most side are connected. I thought so after seeing the figure in the examples....orz
 9 years ago, # |   0 I was comfortable with today's problem set. Thanks to author.
 9 years ago, # |   0 Many Many Thanks to dolphinigle for such a wonderful problemset :)
 9 years ago, # |   0 "The top three of the Division1 solves all three problems"didn't you mean five? Topcoder has a very big influence on dolphinigle, I guess. :)
•  9 years ago, # ^ |   0 My bad :). Thanks for catching that - fixed.Yeah I'm used to write summaries to Topcoder's Editorial and that's pretty much the catch-line ;)
•  9 years ago, # ^ | ← Rev. 2 →   0 Yeah, I guess you wish you could go back in time, like in SRM 492. ;)
 9 years ago, # | ← Rev. 4 →   0 I came across an awkward issue when viewing source code during the contest.The pop-up window had a top-down/vertical scroll bar if needed, but never have a left-to-right/horizontal scroll bar. This brought about a knotty problem that I was NOT able to see those code out of right side of the pop-up window. I tried to view a few submissions and the issue happened all the time, I had to give up hacking. So it is probably a BUG.Anyone else in the same situation? How to solve it?
•  9 years ago, # ^ |   0 i agree with u
 9 years ago, # |   0 Good problemset!I think this contest is organized very well!
 9 years ago, # |   0 Link to test case 12 of D2-D/D1-B, Lawnmower:http://www.mediafire.com/?v7hdvddcbqnbaqv
 9 years ago, # | ← Rev. 3 →   0 Well, I think my solution, despite being O(N3), is ok to pass as it is more complex than original (and it can pass in O(N2logN) if I would use FFT to multiply polynoms) :)
•  9 years ago, # ^ | ← Rev. 3 →   0 It's sort of relieving to hear this from a Java coder - my biggest concern was that C++ coders gained significant advantage due to C++'s inherently fast speed. Also the extra effort the coders who had working N^2 solutions (shik, ivan.popelyshev, and (I think) watashi for example).I'm not going to let this happen again next time :). Though I'm quite happy with how beautiful the passing solutions for current D, it's still pretty evil to ask for that kind of solution. P.S. To be honest I'm not aware how to solve this problem with polynoms at all :)
•  9 years ago, # ^ |   0 I post my solution in editorial as comment (with no proof because I did not have one :) )
•  9 years ago, # ^ |   0 Cool, thanks! It's in the russian forums by the way
•  9 years ago, # ^ |   0 Ooops, I thought I double checked to post it in English and still...
 9 years ago, # |   0 D1--D  is a so fantastic problem!!!!I love it so much! Really elegent! THX