Hi CodeCheffers,
The November 2010 Challenge is now over. Based on feedback received from participants we have decided to rejudge the problem ‘Graph Challenge’. The Rejudge is complete and the final results are announced below.
Contest Statistics:
| Length of Contest | Unique Visitors | Unique Participants | Total Number of Submissions | User who have solved at least one problem |
| 10 days | 12,518 | 307 | 5150 | 176 |
| Country | Total Participants | Average Score per User |
| IN | 213 | 0.97 |
| Rest of World | 94 | 1.73 |
Winners list for the November 2010 Contest:
India:
01. Rudradev Basak (winner of prize money Rs. 12000)
02. Yash (winner of prize money Rs. 8000)
03. Utkarsh Lath
04. Suhash
05. Rishi kesh Dwivedi
06. Gunjan Sharma
07. Surendra Meena
08. Arijit Banerjee
09. Sudipto Das
10. MV Kaushik
10. Paresh Verma
12. Kaushik Iska
13. Amit Karmakar
13. Anil Kishore
13. Ishan Dutta
13. Sunny Agrawal
13. Vamsi Kavala
18. Arpit Sood
19. Mahesh Chandra Sharma
20. Anish Shankar
20. Pulkit
20. Ishani Parekh
20. Sushil Nath
20. Vikas
Global:
01. Tomaz Hocevar (winner of prize money $400)
02. Oleg (winner of prize money $300)
03. Miroshnichenko Yaroslav
04. Tomek Czajka
05. Chaemon
06. Tiancheng Lou
07. Mark Greve
08. Wu Yin
09. Andrey Naumenko
10. Nilesh Dalvi
10. Chen Jiyuan
Congratulations to all.
If you haven’t yet checked out the editorials of the problems to this month’s contest please do so here.
On the last weekend of November (Dates will be announced soon) we are running a 2.5 hours Cook-Off that is organized by Directi Go for Gold Initiative as a warm up before the onsite Regionals.
If there is anything that you would like to let us know then do comment on this blog post or send in an email to [email protected]
Cheers,
Harsh
why is that particular problem being rejudged ?
and what if someone’s earlier accepted code gives error on new dataset ?
That is the challenge problem with minimized scoring. The problem setting panel wanted the test data to be different for this problem so that the contestants may not use the feedback received during the contest to modify their solution as per the test data to get the best score. Hence only the last accepted solution was taken. It is expected that if the algorithm of the submission is correct, it would not fail correctness. However, the case exists for the solution timing out on the new data. For such scenario, we will relax the time limits on the new data to a certain extent to ensure that the earlier submitted solutions are not timed out.
I hope that answers your queries. And the submissions have been re-judged now. The ranks are updated. We will announce the results shortly.
Don’t think it was best idea to try such scenario – now some accepted solutions used 13 seconds and it gives good advantage for score. Think rejudging last 10 submissions or last accepted that not timeout is better (check from earliest to oldest while its not accepted).
We agree Oleg. We had considered various approaches and based on the feedback that we received, as well as the feasibility, we did what we could do best. We believe there are pros and cons to all such approaches and also the system is presently not so flexible to accommodate what you suggest. However, we realize that we need to come up with the most acceptable and fair way of re-judging. Your feedback is most welcome and will help us to move in that direction.
The challenge problem is ‘Graph Challenge’, not ‘Chefs Bad Day’ 🙂
i was asking about “chef’s bad day” problem because it was not told before the contest that you will rejudge it unlike graph challenge problem. Rejudging tie breaker is rather an excellent decision.
In winners list real name + username would be a better combinaton
Like:
.
.
Tomek ( Tomek Czajka )
.
.
ACRush ( Tiancheng Lou )
.
.
looks nice …..
We are sorry for the confusion the problem rejudged was ‘Graph Challenge’ and not Chef’s Bad Day. Results will be updated on the blog soon..
thanks for the clarification
i was asking about “chef’s bad day” problem because it was not told before the contest that you will rejudge it unlike graph challenge problem.