CodeChef brings you another edition of Cook-Off in collaboration with Amritapuri as a part of Directi's Go For Gold initiative. You are cordially invited to participate in the CodeChef September Cook-Off, 2012 at http://www.codechef.com/COOK26 which is also a warm up contest for the Amritapuri ACM ICPC regionals. The contest is open to all. Please note that participation in this warmup contest is not enough for ICPC participation. You must also register at http://icpc.baylor.edu/. For details please visit: http://icpc.amrita.ac.in/2012/.
Time: 2130 hrs 23rd September 2012 to 0000 hrs, 24th September 2012 (Indian Standard Time — +5:30 GMT) — Check your timezone.
Details: http://www.codechef.com/COOK26/
Registration: Just need to have a CodeChef user id to participate. New users please register here
Problem Setter Nikhil Garg (Nikhil ).
Problem Tester: Shilp Gupta (goons_will_rule ).
Problem Editorialist: Ashar Fuadi.
It promises to deliver on an interesting set of algorithmic problems with something for all.
The contest is open for all and those, who are interested, are requested to have a CodeChef userid, in order to participate.
site down?
Do MB mean gigabyte in India? :)
It is always nice to solve 4 problems within 18 minutes, but not so not being able to submit all of them within 44 minutes :(
We had a bad SYN attack once again due to which the site was terribly slow. We are embarrassed to say the least. Now things should be fine. We shall be extending the contest by 45 minutes. We are sorry.
More than three hours for 1 problem :)
The annoying thing is that there is a bug that doesn't get fixed where submissions get blocked. This happened to me last 2 cook offs, not on this one, but by reading announcements it seems you have a problem.
The another annoying thing is getting used to SPOJ's slow computers.
Due to such serious networking issues, it's rather reasonable to make this contest unrated.
Oops, seems that contest was extended.
как решать Coal Scam?
Сортим ребра шефа по убыванию, остальные — по возрастанию. Набираем начиная с ребёр шефа как в алгоритме Крускала.
UPD и ветка не английская.
Спасибо!
p.s. а как теперь сделать ее русской?
никак.
Сначала строить максимальное остовное дерево на M2 ребрах, а потом строить осташийся кусок минимального остовного дерева на M1 ребрах.
Спасибо!
Please find the editorials here: http://discuss.codechef.com/tags/cook26/
ratings still not updated ?? Will it be unrated contest ??
ratings are updated !!! you can see your new ratings now :)