CROC Champ 2012 — Round 3 (Final)
By dolphinigle, 13 years ago, In English

Croc Champ 2012 - Final

Final Update: Congratulations to the prize winners!

Videos for the onsite round (posted by ivan.popelyshev): 1 2 3 4 5 6

Congratulations to the winners of the mixed group (onsite & offsite)!
ivan.metelsky
YuukaKazami
neex.emil

rng_58 deserves honorable mention for the only competitor to correctly submit both D and E :)

Editorial.

Hello Codeforces!

I am glad to welcome you — both onsite and out-of-competition competitors — to the final round of Open Moscow Programming Championship By CROC. I am the writer of this round — Gerald, ivan.popelyshev and Delinur helped me in the preparation of the problems. This is my second round in Codeforces, so far, thanks to the Codeforces team and MikeMirzayanov for giving me this opportunity again!

Please note that this round is held in conjunction with its onsite counterpart, so its starting time may be delayed. Also, since MikeMirzayanov is very busy with the onsite contest at the moment to decrease the load (to avoid any disaster for the onsite competition), I apologize that you may not receive any email reminder about this match.

I've taken feedbacks from my last match into account, so the pretests will be fairly strong. The match should be more interesting for you if you decide to try and solve as many problem as possible, instead of stopping and hacking other codes early in the match :)

The rules below are copied-modified from Ripatti's post:

Competition will happen by usual rules of Codeforces, with hacks and score falling in process of time. The three championship winners will be awarded valuable prizes:

  • 100000 rubles for the first place
  • Apple MacBook Pro 15 for the second place
  • Apple MacBook Pro 13 for the third place

Please remember that the round will be rated only for onsite participants and Division 1 contestants, since the problemset may be more tricky than usual (or it may not be :) ). Division 2 coders can participate, but it will not be rated for them.

There will be five problems ordered by approximately increasing complexity. The scores will be 500-1000-1500-2000-2500. Don’t forget that during contest your solutions will be tested on a small set of pretests. Testing on full testset will be after end of the round. Pretests can don’t cover all cases of input data, so you should test your solutions very carefully.

It is strictly forbidden to publish statements/solutions of the problems before round will be end. Also you shouldn’t to talk about problems, discuss some things about possible solutions of them. Let’s be honest! You can discuss problems after the end of round.

Good luck everyone! I will be watching :)

Announcement of Croc Champ 2012 - Final
  • Vote: I like it
  • +97
  • Vote: I do not like it

»
13 years ago, # |
  Vote: I like it -18 Vote: I do not like it

перенесите, пожалуйста, сразу, насколько надо.

→ Reply
  • »
    »
    13 years ago, # ^ |
      Vote: I like it +4 Vote: I do not like it

    Будут переносить до тех пор, пока у всех участников на онсайте не появится Интернет.

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

Is that okay?
I wonder if he was able to hack others?

→ Reply
»
13 years ago, # |
  Vote: I like it +13 Vote: I do not like it

dolphinigle , thanks for the problemsets which are interesting and thought-provoking.

Is B's intended solution O(m^3)?

→ Reply
  • »
    »
    13 years ago, # ^ |
    ← Rev. 2   Vote: I like it 0 Vote: I do not like it

    I really shouldn't tell until the systest is over :)

    Edit: or rather, started (since this is onsite, it might get delayed until the closing ceremony)

    → Reply
»
13 years ago, # |
  Vote: I like it -12 Vote: I do not like it

Ух, классная задача C. Использовал в решении кучу утверждений, которые хз откуда вообще берутся и как доказываются. Надеюсь на сильные претесты)

→ Reply
  • »
    »
    13 years ago, # ^ |
    ← Rev. 2   Vote: I like it -12 Vote: I do not like it

    Побил свой рекорд занятого места ^_^

    → Reply
»
13 years ago, # |
  Vote: I like it +17 Vote: I do not like it

Nice problem-set, thank you dolphinigle! When I come up with the solution of Problem D, I thought: "When can I write a problem like this?"

By the way, I think it would be better if you post this notification earlier, then there will be more people take part in.

→ Reply
  • »
    »
    13 years ago, # ^ |
      Vote: I like it +16 Vote: I do not like it

    Sorry, I didn't expect I am allowed to write welcome for this match until the last moments (since this is an onsite match).

    Thanks! I hope you enjoyed competing :)

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

Why my Hacking got a result as "Judge protocol is inaccessible"?Is it my fault?if is，why my score didn't change？

→ Reply
»
13 years ago, # |
  Vote: I like it +35 Vote: I do not like it

Problem D is very interesting! I enjoy solving it very much,and look forward to your next round ^_^.

→ Reply
  • »
    »
    13 years ago, # ^ |
      Vote: I like it +21 Vote: I do not like it

    Thank you! I also look forward to writing here again :)

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

The solutions of this contest are not accessible.

→ Reply