Approach used here is greedy and degree of n nodes is increased one by one. To increase degree of all nodes by one, we need n edges. And condition m<=((2nD)/2) is already checked.
1 Like
guys,most of you have made same mistake.you all are printing edges and then checking the condition.
@nmalviya Try this:
1 0 0 1
your output is 1 1.but no. of edges to be printed is 0.
hope this helps.
There is a constraint mentioning d>=1
Solutions are rejudged…
2 Likes
Yes, I have the same doubt.
Rejudging solutions still doesn’t give us the time we would have got “during” the contest.
Not to mention those 10 minutes of “running” for each supposedly wrong submission.
So many faults while hosting such an important contest is simply not justified.
4 Likes
Solutions have been rejudged
1 Like
They have just made a joke of acm-icpc. 5 adhoc questions , 20 mins long queue, login suspension , unverified data of “F” question. Its one of the worst contest i have ever given 
and the excuse they are giving is that it happened with everyone else. Cant find anything wrong with this solution http://ideone.com/QMnxGN
1 Like
Did u guys handle the case when m=0 and n=0?? Even I couldn’t figure it out until the contest finished.
True, My team and I made 5 submissions for this questions, and each returned WA after 10 minutes, and upon rejudging, all got Accepted. This not only wasted a lot of time and energy spent on this question, but also prevented us from moving on to the next question.
We understand server capacity couldn’t have been estimated, but having weak test cases is just not cool.
I just don’t know what people at Codechef office are happy about.
Reference: https://www.facebook.com/CodeChef/photos/a.10150302285647799.346300.53227312798/10154057722962799/?type=3&theater
There servers weren’t ready to take the load of the high submission rate but still they went for the Common Online Test. My team was logged out 9-10 times due to session limit and the submission’s were in Queue for more than 20 minutes. It’s just frustating.