DmitriyH's blog

Codeforces Round #236 Statistics
By DmitriyH, 11 years ago, In English

Codeforces Round 236 (Div. 1) and Codeforces Round 236 (Div. 2) round statistics :

Div. 1

First accepted:

A (00:03) cxlove
B (00:15) glassices
C (00:10) snuke
D (00:18) Petr sillycross
E (01:46) fsouza

Total hack attempts: +39:-24

Top-8 hackers:

500 scott_wu +5:-0
400 cgy4ever +4:-0
300 -imc- +3:-0
250 Gassa +3:-1
200 TankEngineer +2:-0
200 cxlove +2:-0
200 vepifanov +2:-0
200 anta +2:-0

Other info






FAQ

Div. 2

First accepted:

A (00:05) Paiev SC_pRo_ION aangairbender alexkru diegoximenes fdfdfd123
B (00:12) tranhuy
C (00:07) the_redback
D (00:33) just-registered-user-without-any-other-submits
E (00:30) xlyle

Total hack attempts: +29:-78

Top-18 hackers:

400 hirokazu1020 +4:-0
200 pjgblt +2:-0
100 gpita +1:-0
100 hazael.vidales +1:-0
100 LoneFox +1:-0
100 sheksha +1:-0
100 minthe +1:-0
100 Slyusar +1:-0
100 krooonal +1:-0
100 just-registered-user-without-any-other-submits +1:-0
100 ziad.mohamed +1:-0
100 hnust_sunxiaoyun +1:-0
100 abhra73 +1:-0
100 sergio10barca +1:-0
100 JuanMata +1:-0
100 lwd_acm2013 +1:-0
100 oreh +1:-0
100 mosiomohsen +1:-0

Other info






FAQ

Any comments or suggestions are welcome :)

  • Vote: I like it
  • +54
  • Vote: I do not like it

»
11 years ago, # |
  Vote: I like it +1 Vote: I do not like it

I want to see how many submissions got AC/WA/TLE in problems. Do you think that this is necessary? Can you put these values in next contests (a simple table is still OK). Thank you. :)

→ Reply
  • »
    »
    11 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    I agree, that WA/TL/ME distirubution would be very interesting.
    And I would implement it, if verdict type information was available from standing pages html data directly.
    But could not find any simple way to acquire this data. Probably, it can be done, parsing all submissions of the round.
    It's to difficult to implement and requires a lot of time. I have another interesting ideas, which are less time-consuming, but also interesting after visualization :)
    The free time availability is the only problem, which prevents these ideas from implementation and presentation..

    → Reply
»
11 years ago, # |
← Rev. 2   Vote: I like it +3 Vote: I do not like it

finally, i see my name here! :)
albeit, i made only one hack, that too at 01:59:11! :P

→ Reply
»
11 years ago, # |
  Vote: I like it 0 Vote: I do not like it

What does "Hacked" mean? Thanks!

→ Reply
  • »
    »
    11 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    It is described in FAQ (link above, at the end of post).

    → Reply