HolkinPV's blog

Codeforces Round #113 (Div. 2)
By HolkinPV, 13 years ago, translation, In English

Welcome dear friends)

We are glad to introduce you regular Codeforces round #113 for Div.2 participants. Everyone can traditionally participate in it.

Problems are prepared by known command of authors: Kholkin Pavel (HolkinPV), Nikolay Kuznetsov (NALP), Artem Rakhov (RAD). Also thanks to Gerald Agapov (Gerald) for his help, Michael Mirzayanov (MikeMirzayanov) for Codeforces system and Mary Belova (Delinur) for translating problems.

In todays contest would be one innovation. Score distribution would be dynamic. More information you can find here)

We hope that todays round would be succesful. We wish you good luck and high rating!

UPD: The contest is over. Hope you enjoy the problems) the editorial is already here)

Congratulations to winners:

  1. Avalanche

  2. seiya

  3. Konon

  4. yongheng5871

  5. I_dont_have_girlfriend

  6. ibra

  7. Doriam30

  8. unknown79

  9. UESTC_Hetalia

  10. lisang

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

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

My friend tried to register and got the message "Cannot register user now. Try later or contact the administration.". Why?

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

That wasn't a good idea . At least If you told before I think that would be better . But thank you for your great idea . Hope best for everyone .

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

Can anyone give some hint(s) for problem D? :D

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

    A typical DP problem, but you must record the <shoeId, customerId> pair during the dp loop.

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

If after the test completed, the number of contestant who can solved the problem change, will it change the problem's score?

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

    Yes, the problems' score can change after system testing.

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

On the Contest page, both of 114 CF contest are for DIV 1 ?

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

I was wondering what point distribution the author had thought for the problem set ?

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

Any tutorials coming?

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

Please publish the editorial in English, is the second consecutive round that comes only in Russian. If not possible, some better than the google translator.

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

Please provide the Editorial in English..otherwise wont get any benefit by mere participation !!

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

    It's already published. http://mirror.codeforces.com/blog/entry/4173?locale=en

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

      Thanks !! Please explain the approach to Problem E ie Tetrahedron.

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

        Okay, the solution is DP. Let's number the vertices A, B, C, D from 0 to 3 instead, and let dp[i] mean how many cyclic paths currently begin and end at i. At first, we only have dp[3] = 1 and dp[0] = dp[1] = dp[2] = 0, and we only are considering paths of length 1. Now, to calculate how many cyclic paths of length n there are, you iterate n times, updating the DP table in the following manner (pseudocode): http://pastebin.com/XyNsyMk6

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

help!help!I got a WA on test #12,my code is [submission:1403496]，the former 11 tests are all passed, Who can help me find out the problem of my code?

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

    You shouldn't /4 because 3^n is modular (try *(1000000008/4))

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

      Thank you for your help! :)

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

    In order to divide on 4 by modulo of 1e9+7 you need to multiply by its inverse (found with extended gcd or basing on Fermat's theorem).

    → Reply