CodeChef invites you to participate in the May Cook-off 2014 at codechef.com/COOK46.
Time: 18th May 2014 (2130 hrs) to 19th May 2014 (0000 hrs). (Indian Standard Time — +5:30 GMT) — Check your timezone.
Details: codechef.com/COOK46/
Registration: Just need to have a CodeChef user id to participate.
New users please register here
- Problem Setter : Anudeep Nekkanti
- Problem Tester and Russian Translator : Gerald
- Editorialist: Praveen Dhinwa
- Mandarin Translator: Gedi Zheng & Minako Kojima
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.
Is taking O(M) vertecies from the intial tree and searching minimal cost maximal flow a right idea for the last problem?
Yes it is correct idea. You need to also consider newly added nodes.
I did, but it seems there is a bug somewhere in my code. Thanks for the contest, I pretty enjoyed inventing the solution for this problem :) Keep doing!
Thank you :)Please find the editorials here: http://discuss.codechef.com/tags/cook46