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.
sounds cool! Good luck
Good luck everyone
This round is writen by MikeMirzayanov.Sounds very good!Good luck to everyone!
MikeMirzayanov's round.... sounds nice! GL&&HF
I'm sure there will be nice questions :)
I new people join, What is hack?
Please help me?
**Just click here and you'll see.
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... :/
That was really funny round. Especially hacks for problem A. Also really nice tasks.
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?
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
What is the proof that Greedy works well for Problem C? I just assumed that Greedy was the right method, by intuition.
Roughly because of the fact that you cant split groups or give a table to more than 1 group.
Because, 1. You can't split the groups 2. A group holds the table till the very end
In problem A , I made 10 successful hacks , however my solution is wrong itself , but no one in my room hacked mine .. :D
hehe =_=#
It was a very good contest.............I enjoyed.........
this round trolled me: 46 place before pretests and 542 after )
At least I'm not the only one :-).
Can anyone give me a hint for Prob E ?
Floyd-Warshall?
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()) ?
Is this possible to see what input a participant used to hack?
Yes, open http://codeforces.me/contest/416/hacks. find the row for you and double click on verdict column.
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).
Try clicking on the arrow on the upper-right corner and typing "bli0042".
sneaky :) thanks
Here
Thanks a lot. My bad for not seeing it
Round stats
good contest! I did today.
My greedy approach for D didn't work. Can you tell me why? 6357863
Because on the test #53 we need at least 5 sequences, but your program has written 4.
Surely it's obvious. Maybe you can fix it for few so that it can be right
Editorials??
Since there are not any tutorial.Can anybody explain the method to solve problem D.
Here it is