### MikeMirzayanov's blog

By MikeMirzayanov, 10 years ago, translation,

The round will start on 08:00 (UTC) of April, 13. It will be a kind of unusual round because at first for a long time Gerald didn't work much on round. It was prepared by me (how it is interesting to write a round!), Nerevar with the help of Gerald and Fefer_Ivan-а. Maria, many thanks for translations!

It will be classical points: 500 — 1000 — 1500 — 2000 — 2500.

• +135

| Write comment?
 » 10 years ago, # |   0 sounds cool! Good luck
 » 10 years ago, # |   0 Good luck everyone
 » 10 years ago, # |   +12 This round is writen by MikeMirzayanov.Sounds very good!Good luck to everyone!
 » 10 years ago, # |   +16 MikeMirzayanov's round.... sounds nice! GL&&HF
 » 10 years ago, # |   +4 I'm sure there will be nice questions :)
•  » » 10 years ago, # ^ |   +5 **Just click here and you'll see.
 » 10 years ago, # | ← Rev. 2 →   0 I don't know, if I'm the only one, but really, it seems that problem B and Problem C are easier than problem A... :/
 » 10 years ago, # |   +3 That was really funny round. Especially hacks for problem A. Also really nice tasks.
 » 10 years ago, # |   0 For C, I sorted the groups in descending order of the amount of money they paid and then the tables by their size — my soln didn't get accepted. What's the right way of solving it?
•  » » 10 years ago, # ^ | ← Rev. 2 →   0 Your way is right. Sort groups in descending order of money, sort tables in ascending order by size. Here is my code: http://pastebin.com/JD9AZmsb
•  » » » 10 years ago, # ^ |   0 What is the proof that Greedy works well for Problem C? I just assumed that Greedy was the right method, by intuition.
•  » » » » 10 years ago, # ^ |   0 Roughly because of the fact that you cant split groups or give a table to more than 1 group.
•  » » » » 10 years ago, # ^ |   0 Because, 1. You can't split the groups 2. A group holds the table till the very end
 » 10 years ago, # |   +11 In problem A , I made 10 successful hacks , however my solution is wrong itself , but no one in my room hacked mine .. :D
•  » » 10 years ago, # ^ |   0 hehe =_=#
 » 10 years ago, # |   +7 It was a very good contest.............I enjoyed.........
 » 10 years ago, # | ← Rev. 2 →   +9 this round trolled me: 46 place before pretests and 542 after )
•  » » 10 years ago, # ^ |   +3 At least I'm not the only one :-).
 » 10 years ago, # |   +1 Can anyone give me a hint for Prob E ?
•  » » 10 years ago, # ^ |   +2 Floyd-Warshall?
 » 10 years ago, # |   0 If we have 2 sets — a, b is it possible to insert all elements of b into a faster then b.size() * log(a.size()) ?
 » 10 years ago, # |   +4 Is this possible to see what input a participant used to hack?
•  » » 10 years ago, # ^ |   +4 Yes, open http://codeforces.com/contest/416/hacks. find the row for you and double click on verdict column.
•  » » » 10 years ago, # ^ |   0 Is there any way to limit the hacks to certain user? I was trying to find the ones I used for a friend (I eventually found them all by scrolling down the page, but wondering if there's an easier way).
•  » » » » 10 years ago, # ^ |   0 Try clicking on the arrow on the upper-right corner and typing "bli0042".
•  » » » » » 10 years ago, # ^ |   0 sneaky :) thanks
•  » » 10 years ago, # ^ |   +5
•  » » » 10 years ago, # ^ |   0 Thanks a lot. My bad for not seeing it
 » 10 years ago, # |   +14
 » 10 years ago, # |   0 good contest！ I did today.
 » 10 years ago, # |   0 My greedy approach for D didn't work. Can you tell me why? 6357863
•  » » 10 years ago, # ^ |   +1 Because on the test #53 we need at least 5 sequences, but your program has written 4.
•  » » » 10 years ago, # ^ |   -7 Surely it's obvious. Maybe you can fix it for few so that it can be right
 » 10 years ago, # |   +20 Editorials??
 » 10 years ago, # | ← Rev. 2 →   0 Since there are not any tutorial.Can anybody explain the method to solve problem D.
•  » » 10 years ago, # ^ |   0