Russian Code Cup 2016 — Final Round and Online Contest
By RussianCodeCup, history, 8 years ago, translation, In English

Hi, everyone!

Tomorrow, on September 18, 2016, at 12-00 the Final Round of Russian Code Cup 2016 will take place. Top 50 participants of the Elimination Round will take part in the contest and have a chance to win great prizes. The length of the Final Round this year is 2 hours, the Final Round participants will compete online. You can watch the Final Round at http://russiancodecup.ru

Meanwile we are pleased to announce that the Russian Code Cup team together with Codeforces project have prepared a small surprise to all those who didn't manage to get to the Final Round of RCC-2016. After the Final Round ends, at 14-05 Codeforces will host online-contest with RCC-2016 Final Round problems.

The contest will use ACM ICPC rules and will not be rated. Problems will be in English and in Russian. Problems were prepared for Russian Code Cup Final Round, so they are quite difficult, the contest is mostly suitable for Div1 participants. Of course, we would like to ask the Final Round participants do not use the contest for testing their upsolved solutions, please wait until the end of the online contest and use the problem archive.

So, everyone is welcome to watch the Final Round and then to take part in the online-contest! Good luck to everybody!

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

»
8 years ago, # |
  Vote: I like it -40 Vote: I do not like it

What's the point of making it for div1 only if it's unrated for everyone?

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

    I think div2 participants can also participate (but not recommended to do so)

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

It will be much difficult for div2

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

Registration opened before Round 372's rating changes, therefore, there are some colors that are wrong in the registrants' list, which is very weird because the ratings are correct.

Some blue people have a better rating that some purple people, for example...

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

    Do you know the meaning of "Recommended" ?

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

      Yes, but you probably didn't get the meaning of my comment...

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

Anyone knows if the tasks will be sorted in the order of their expected difficulty?

→ Reply
»
8 years ago, # |
← Rev. 2   Vote: I like it -14 Vote: I do not like it

(y)

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

    You are wrong. Even few finalists (!) didn't solve any problem.

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

have the problems been sorted by difficulty ?

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

Nobody solved more than 3 problems out of 6. Nobody in this unofficial round solved more than 2 problems. (I didn't solve anything — I started 1 hour late, read the problems, looked at the scoreboard and decided not to bother.) Seems like the contest would have benefited from more time or keeping backup problems e.g. for next year.

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

It seems that N * M <= 10000 was chosen instead of the usual N, M <= 100 such that solutions based on Hall's Theorem fail.

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

    My solution is based on Hall's theorem and passed (are there any other solutions?). In the worst case you can handle cases with N = 1 separately, and when N >  = 2 it should pass easily.

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

      I overlooked the fact that O(n2·m2) passes. Simple implementation for anyone interested — 20743833.

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

Editorial is here http://www.russiancodecup.ru/en/press/razbor-zadach-finalnogo-raunda-rcc-2016/

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

Do anyone know the O(n) algorithm of problem B described in the solution?

→ Reply