Croc Champ 2012 — Qualification Round
By MikeMirzayanov, 13 years ago, translation, In English

Hi everybody!

Let me remind you that on the 3rd of April, at 08:00 the Qualification Round of the Open Moscow Programming Championship By CROC will start.

You need to participate in the Qualification Round to make it to Round 1. Contestants who gain a score equal to the 1000-th place finisher score or greater will advance to the Round 1 (also you need to gain positive score).

At the Qualification Round you will find a few simple problems, roughly ordered by the increasing complexity. During the Qualification Round the problems are judged only on pretests and system testing will take place after the end of the Qualification Round (round continues for 24 hours). The pretests do not cover all possible cases of input data, test your programs carefully! The Qualification Round has no hacks or decreasing values of the problems.

The round will last for 24 hours, but it does not mean that we encourage you to spend all this time solving of problems. We hope that most participants will cope with the problems (or with most problems) in a shorter period of time. This duration of the round is chosen so that each participant could find a convenient time to participate.

Before the end of the round it is strictly forbidden to publish the problem statements/solutions/any thoughts and ideas about them elsewhere. It is forbidden to talk about the problems, discuss the statements and so on. Be honest and let the best men make it into Round 1. When the Qualification Round is over, you can discuss the problems and solutions.

You can register for the round at any time up to its end.

The results of the round will not affect the rating, non-competitive participation in the round is not allowed. However, all tasks will go to the archive after the end of the round.

Best of luck and enjoy solving the problems!

UPD: The contest is over! Thank you for your participation. We will remove cheaters soon and the results will become official. Unofficially, the Round 1 cutoff is 1950 points.

UPD 2: We have removed obvious cheaters and people who are under 18 years old at the time of registration. If your results have been removed in error, please contact me for clarification. Now, the Round 1 cutoff is 1900 points.

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

Comments Comments (46)
| Write comment?
»
13 years ago, # |
  Vote: I like it 0 Vote: I do not like it

I am getting a message like 'Only Championship registered users are allowed to participate in this round'..

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

    To participate in the championship, you must register on http://www.crocok.ru/championship/ (in Russian) before April 4, 2012.

    → Reply
»
13 years ago, # |
← Rev. 4   Vote: I like it -15 Vote: I do not like it

Will the contest be unrated?

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

Sir, What should I do to register in the Championship,please?I register in the contest in http://codeforces.net/contests,but I failed.

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

rated?

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

    Did you read the announcment?

    The results of the round will not affect the rating.

    Also, it is good idea to read previous comments: http://codeforces.net/blog/entry/4262#comment-86513

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

      I’m sorry about my comment, I didn’t read clearly the article :(

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

    And it is very-very bad style to change the sense of your comment completely.

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

      Sorry, I just want to delete my foolish comment. I really beg you pardon.And I have changed it back already.

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

"The Qualification Round has no hacks or decreasing values of the problems." But the value is decreasing...

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

"The Qualification Round has no hacks or decreasing values of the problems." Somehow it is contradicted in the contest. I just got 960 for the first submission of A :)

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

Hi, I registered at the site, but can't participate in the contest since registration is cloesd. Is this intended?

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

"Contestants who gain a score equal to the 1000-th place finisher score or greater will advance to the Round 1 (also you need to gain positive score)"

If there are fewer than 1000 participants does that mean that as long as you get a positive score, you can proceed to the next round? =D

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

    definitely, but there are already more than 1k competitors.

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

      I might point out that up to now, the number of participates who have a non-zero score is strictly less than 1,000.

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

It seems that not so many people participate in this contest.

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

    I think the number of participants is much bigger than the number of people who are actually willing to pay for their trip to Moscow for the finals in case they would advance :)

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

how to cancel our registration in croc? i didn't read the text carefully and didn't notice you must be at least 18 to participate. What shall I do?

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

    why do you want to cancel registration ?

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

    see the register list after the green “registration complete” and find your name in this list. there will be an 'x' beside your name. it seems that you can cancle your registration here. ( by the way, i dont try it:) )

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

      why so much negative points?

      to jehad: because the contest is not designed for me. to liuyubo : i've tried it before.

      any how it's solved now. thanks for your answer.

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

how did you solve problem E ???

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

    Bruteforce of course!

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

      Why had I negative votes? I think an O(NL) bruteforce is quick enough for this problem. I have tested a lot of data which I tried to make as large as I could, and none of it takes more than 1 second.

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

        May be because it is not bruteforce actually?

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

        Maybe for "I do not think there exist a better solution" part.

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

    simplexml class + xpath method, 2 lines of code. lol (PHP)

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

      .. and then time limit exceeded? lol

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

      1469680 05:21:45 sander E — BHTML+BCSS PHP Runtime error on test 8 50 ms 10016 KB

      I am afraid that you did not pass the system test.

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

what's up with system test?

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

When system testing is start??

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

In problem E, can someone explain me why the answer for the following case is '3' ?

<hnhi><ihjhi><ihjhi></ihjhi></ihjhi><hnhi/></hnhi><h><hnhi><hnhi><ihjhi></ihjhi></hnhi></hnhi><ihjhi></ihjhi></h> 1 hnhi ihjhi

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

    2 ihjhi in first hnhi
    1 ihjhi in the middle

    You shouldn't calculate pairs (ihjhi in hnhi), but only ihjhi, that lies in any hnhi

    For example answer is always not bigger than tags number

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

Will Round 1 be rated or not? There is no article announcing it.

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

Will there be hacks in round 1? thanks

→ Reply