CHEFSTON: 7336[>= 30.0] / 6301[>= 70.0] / 6265[>= 100.0]
GCDQ: 5456[>= 40.0] / 3430[>= 100.0]
SEAVOTE: 4300[>= 50.0] / 4134[>= 100.0]
ONEKING: 2946[>= 20.0] / 2944[>= 30.0] / 2939[>= 50.0] / 2851[>= 80.0] / 2843[>= 100.0]
CLPERM: 2733[>= 13.0] / 2703[>= 17.0] / 2187[>= 30.0] / 1949[>= 83.0] / 1946[>= 87.0] / 1945[>= 100.0]
QSET: 1957[>= 10.0] / 1899[>= 15.0] / 1823[>= 25.0] / 973[>= 30.0] / 912[>= 45.0] / 824[>= 80.0] / 816[>= 100.0]
SEAND2: 1324[>= 0.0] / 1324[>= 20.0] / 1324[>= 40.0] / 1324[>= 60.0] / 262[>= 80.0]
SEALCM: 410[>= 25.0] / 350[>= 50.0] / 341[>= 100.0]
XRQRS: 899[>= 40.0] / 178[>= 100.0]
RANKA: 268[>= 20.0] / 260[>= 100.0]
Contest time: 1 days 8 hours 0 minutes to the end
Enjoy last hours of the contest.
Tool is available at Betlista/codechef-long-stats · GitHub
Hey @betlista, Good Job!!
But there is request, Can you post the problems in the order it is displayed on contest page? i.e. in Highest to lowest submission order… It would be really helpful…! I mean just switch the order of problem name and its submission…!!
There is a typo in the title.
My tool retrieves the stats from ranking page where the ordering is different, but your request is valid and I reorderd it
Thats awesome…Thanks @betlista …
@betlista Is your scraper open source, like is the code available somewhere I can see?
Currently it’s not available… Yesterday I started to play with GitHub, but it was a pain I have to say
Seriously? Git and GitHub should be pretty easy to use. What problem are you facing? I may be able to help you.
Very sad story: I created repository and I wanted to use SVN, because I know it already and do not want to learn Git and that should be possible - Support for Subversion clients - GitHub Docs
Then I downloaded portable GitHub for Windows, but the set of commands failed on
git remote add origin, so later I tried Git pluin from Eclipse, not working too. At the end I stopped playing with it…
I found the problem - proxy. I’ll share both stats and chrome plugin soon (probably after the contest).
Maybe highest to lowest full score order would be better. The number of submissions just tells us which problems have easy subtasks.
That was a surprise for me also, it is not the same in current contest. My goal was really find the easiest subtasks and help others to get “one more point”, so in general doing the competition more challenging and more interesting. In first competition I had also spreadsheet with that ordering, but later I found it’s not so easy to share publicly (because of maintenance).
First few rounds would be currently:
7336 CHEFSTON subtask 1
6301 CHEFSTON subtask 2
6265 CHEFSTON subtask 1+2
5456 GCDQ subtask 1
4300 SEAVOTE subtask 1
4134 SEAVOTE subtask 1+2
3430 GCDQ subtask 1+2
…so according to stats it seems, that solving SEAVOTE completely is easier than solving GCDQ, but subtask 1 for GCDQ is easier than subtask 1 for SEAVOTE…
What seems interesting to me are also the anomalies like the one which can be seen above - there are users who solved subtask 2 but not subtask 1… My opinion is that in such case they should not get points for subtask 2, while their solution is clearly not ok (holds only if tasks are comparable - for example for QSET it is ok to solve it without updates fiirst - subtask 3 and than with updates - subtask 2).