Codeforces Round 445 (and Technocup 2018 — Elimination Round 3)
By KAN, 7 years ago, translation, In English

Hi all!

This weekend, at 16:05 UTC on November 12th, 2017 we will hold Codeforces Round 445. It is based on problems of Technocup 2018 Elimination Round 3 that will be held at the same time.

Technocup is a major olympiad for Russian-speaking high-school students, so if you fall into this category, please register at Technocup 2018 website and take part in the Elimination Round.

I want to thank MrKaStep, komendart, veschii_nevstrui, bixind, AndreySergunin and DPR-pavlin, who authored and prepared problems for Technocup, and Lewin, who kindly suggested the last problem. I also want to thank zemen and AlexFetisov for testing the round.

Div. 1 and Div.2 editions are open and rated for everyone. Register and enjoy the contests!

UPD: We apologize that we run into technical issues during the round. The round will be unrated. I hope you liked the problems.

Anyway, congratulations to winners!

Технокубок 2018 - Отборочный Раунд 3

  1. potapov_al
  2. 300iq
  3. qoo2p5
  4. Vosatorp
  5. manoprenko

Codeforces Round 445 (Div. 1, based on Technocup 2018 Elimination Round 3)

  1. V--o_o--V
  2. Petr
  3. Um_nik
  4. SirShokoladina
  5. LHiC

Codeforces Round 445 (Div. 2, based on Technocup 2018 Elimination Round 3)

  1. mosthenio
  2. Ingus
  3. paulsohn
  4. xX_ucfNOTpt_Xx
  5. Omar_Morsi

Editorial is published.

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

Comments Comments (188)
| Write comment?
»
7 years ago, # |
← Rev. 2   Vote: I like it +65 Vote: I do not like it

This round will be my first blue-name-contest. Good luck.

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

    We don't care

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

    This round will be rotavirus's eighteenth purple-name-contest. Good luck.

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

    I’m from China and I had a bad round because of the terrible Internet.

    502 Bad Gateway

    MikeMirzayanov All of my classmates also met this problem for half an hour, could you plz give us a unrated?

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

Hope that there would be no issues like the last "rated" contest...

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

    We did have issues though

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

      Too bad things are not destined to be as we have wished... :<

      → Reply
»
7 years ago, # |
← Rev. 5   Vote: I like it -66 Vote: I do not like it

.

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

iS iT rATED !?

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

First contest I'll have time to participate in for 2 months. Hopefully I'll be able to reach expert!

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

another contest! thank you!!

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

By the way, this contest round number is 445, and this contest ID is 890 in Div.2 one. (889 in Div.1) Finally, Codeforces achieved to a host y = 2x round. (Let y be the contest ID, let x be the round number)

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

    Nice observation ;)

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

    good one

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

    And can you make graph of y-2x vs round number? ;)

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

      Yes!
      To make the graph more easier to see, I made the graph of 2x-y vs round number, not y-2x vs round number.

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

        you freak _/_

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

        That sudden fall of 30.. Isn't it strange? What exactly happened?

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

          Well... the value of 2x - y decreased, while 2x increased, which means that y increased faster. It means that there were rounds that are not regular CF rounds.

          If we have a look at contest list, we can see that there was whole bunch of non-regular rounds between Round 340 and Round 350.

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

So exciting about this contest! Goodluck fam!

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

Happy 11.11 festival! :D

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

KAN's contests are very interesting, hope for everyone a good time and high rankings.

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

I wish all of newbies to be pupils. It is time to change colours. Good luck to all!

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

Chinese students have finished the Noip.So I'd like to enjoy this contest instead of caring my low score.XD

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

Will hope that the contest will not have any glitches and the contest will remain rated :) KAN

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

These days codeforces contests frequency is very low :(

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

    A correction indeed, Codeforces RATED contest frequency is low.

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

I don't want unrated contest ;(

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

Why there is no extra registration for Div.1 ?

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

laggforces

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

It Will be unrated :(

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

am I the only one who has problems to load the contest area?

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

Servers of CF , during the contest !

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

    This image is an upvote machine. Every time servers are down people are racing to post this.

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

WTF is going on with the server???

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

Will the contest be made unrated?

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

This contest should be unrated. There are way too many server issues for this round to be fair

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

Shouldn't it be unrated? Some people may take a web on the computer, and they write it when the web does not work, it's unfair~

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

KAN will this round be unrated? I really hope not but it probably will.

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

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

is it rated?

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

My whole contest f**ked up due to servers issue.

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

Many people couldn't submit for 1/2 hour because of "502 Gateway Timeout" and various other connection errors.

Is it rated?

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

    I believe it was a sitwide problem, so it affected everybody. Maybe because everyone was affected equally it can remain rated?

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

      i got very low score because I had to wait more than 30 minutes to submit A and B. There's no way it can be fair at this point. Within that 30 minutes, there can be huge differences in ranking if order of submitting is different for everyone.

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

        That can be adjusted though, I'm sure they have logs of when the site was down, surely anyone who submitted after it can have their time penalty adjusted to what it would be as if no issues occurred.

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

          "anyone who submitted after it can have their time penalty adjusted to what it would be as if no issues occurred"
          How would one know what this adjustment should be? I understand you had a good contest, doesn't mean it was fair for the others, man.

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

            The adjustment should be the amount of the the site was down for. It's not as if some people were only unable to access the site for 5 minutes, it was the same for everyone. As for some people not being able to see problem statements, I've already accepted that is a grey area in which some people were affected more than others. That is something the contest runners will have to decide upon. But if we're simply talking about time penalties, then yes, it can be adjusted fairly for everyone.

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

      Also, I accidentally closed the problem page and was unable to open it for the next half an hour. There's no way this contest should be rated.

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

ɔopǝɟoɹɔǝs˙ɔoɯ is temporary unavailable

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

Codeforces in a nutshell

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

I skipped free pizza for this :|

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

I have class tomorrow QAQ . I should go sleep.

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

Two unrated in a row? PLEASE GOD NO.

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

The good old Codeforces seems to be back, the way we remember it. I like the problems, doe.

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

Problem C, div2. Test 2.

What about answer: 1 -> 1 -> 1 -> 2 -> 1 -> 2

I suppose this is correct for sequence "0 1 0 1 3" in journal but requires only 2 rooms instead of 3 in official answer.

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

    emmm,in the 3rd second,the number 2 can't refer to 0

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

    Quick tip: Never discuss a problem during contest time, regardless it is rated or not, man.

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

Codeforces round 502

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

You can't say everyone was affected equally .

Suppose server was down from t=x to t=x+30. One solves at t=x-1 and submits it at t=x-1. And one who solves at t=x will submit at t=x+31.

Further imagine if First guy has access to read the next problem and second guy doesn't havve since he hasn't loaded the problem page of next problem .

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

    The first point can easily be fixed by simply subtracting 30 from all submissions made after x. The second point is a more complicated matter, and could go either way.

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

      The first point can't be solved either. Say the servers went down at time t. Someone may have solved a problem at time t + 5 and had been wanting to submit his code, but only got to submit it at t + 30 (when the servers were back up). However, he would receive a score equal to someone who solved it at t + 25, and submitted at t + 30, by your logic.
      And there were others like me who stopped the contest assuming it would be unrated for sure (as it was only natural to assume so).

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

Is it only me or someone else get 502 error during the contest... Just managed to log in.

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

let's take into account that many of us left the coding arena when the site was not working only to come back later to find out that contest was extended. it's not fair at all to make this contest rated.

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

Codeforces Should Really Buy A New Server To Work When The Current One Is 502. Codeforces Should Really Buy A New Judger As An Alternative For The Stuck Judge System In The Contest. Codeforces Should Really Buy A New Set Of Problems In Compensate For Several Unrated Problems These Days.

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

I hope admins realize that extending the contest by 30 mins does not make up for the issues. Everyone was affected differently so it would be completely unfair to rate it.

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

make codeforces great again

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

Internal Server Error again :( Leaving the contest.

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

The contest should be unrated. As many others, I thought that the codeforces is down, so I gave up. But now I can see they extended the time, which doesn't fix things.

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

You can't just extend 30 minutes and say it's rated. What about all those people who left in the middle of the contest to do something else? What about the people who solved the problem at the beginning of the downtime interval vs. at the end, are they all the same?

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

Codeforces teaching me more about Servers Breakdowns than Algorithms and Data Structures.

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

going rated anyway?)0))))

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

    Yes they should not make two consecutive contests unrated .... But Codeforces is down these days which ruins fun of contests :(

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

      read this

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

      That's not a valid reason at all to make the contest rated.

      1 — While the server was down some people left the problems opened hence they got extra time to find a solution.

      2 — Some open lots of Codes to hack and generated test cases while the server was down.

      3 — Some just left the contest since the servers were down for 20+ min ( Most will think " For sure it'll be unrated " and do so.

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

It's still impossible for me to perform a hack... The server is just too slow and will stuck at the hack page...

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

Alright it's time to vote.

http://www.strawpoll.me/14385815/r

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

I am not sure if it was a DOS attack or the servers crashed for an unknown reason, if it was, we can't let the terrorists win, make it rated!

I am just saying this because I think I will go up, so don't take it seriously :P

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

Sh*t. I opened movie when CF servers gone down, and then my friend told me they are back, then wrote something for B and it is hacked now by Um_nik. Now I have to do binary search on movie for finding where I was. Really sh*t.

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

How to solve C? I can only think out some kind of DP that can't even fit memory limit.

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

    I think we can fix the value which we can get maximum value and count how many way to achieve it, i need 1 more second to submit and know whether it's correct or not

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

    1) Brute force it

    2) Search for the first two columns on OEIS

    3) Find a pattern

    4) ???

    5) Profit!

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

      A 9gagger, I see you're a man of culture as well.

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

      I wonder how many contestants solved this problem without OEIS.

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

    In my opinion, greedy algorithm can be a fine approach. I used an array (I'll name it A): element with index i is used to store the index of the room which was last visited in minute i. (if this room is visited again in the future, the value of this element is changed back to 0).

    Then I did a linear check over all numbers in the notebook:

    Assume that the number written in minute i is x. If there was a room which was last visited in minute x, we could assume that that room is visited again in minute i (it's the easiest way to handle without adding new rooms). Assign A[x] to A[i], then assign 0 to A[x]. Otherwise, since no room was last visited (until minute i) in minute x, the man must have enter a new room. Increase the room count by 1, and assign the index of the new room to A[i].

    Hope this will help. And sorry if my expressions could be complex though...

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

      With all due respect that is very nice but he asked about Div1 C

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

        Ouch... sorry then. Should I delete this for now?

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

          Well, some will find it useful anyway

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

            Hmm okay, provided that they ended up seeing this long comment and figure out my misunderstanding... :< Anyway, thanks, just for having a nice response ;)

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

    To solve Div1 C, Div2 E

    Let's calculate two functions:

    dp[i] — How many [i] permutations exists, where last element is i and will return correct maximal value.

    dpsum[i] — How many [i] permutations exists, where element i is in one of the last k positions and algorithm returns correct maximal value.

    Then we can calculate these functions in linear time:

    To calculate dp[i] we simply append i to the end of all the [i-1] permutations, where i - 1 is located in one of the last k positions and algorithm will return correct maximum value.

    dp[i] = dpsum[i - 1]

    To calculate dpsum[i] we must remove all permutations, where maximum value will be located outside the last k elements of permutation from dpsum[i - 1]. Then append new element to the end of permutation, it must be less than previous maximum value. So multiplying by (i - 1) we add this new element and increase all larger, equal permutation element values by one, so we get [i] permutations, where i is located in range [i - k + 1, i - 1]. Lastly, we must append all permutations which have maximal value i in the last position of [i] permutation, we calculated it in dp[i].

    Then we can calculate the number of all good permutations, where correct maximum value is returned by algorithm.

    Lets fix position i, where maximum value n will be located. Then first i element prefix of permutation must return correct maximal value and maximal element is in the last position of permutation formed by prefix, so we use dp[i]. We choose order of last n - i elements in

    Unable to parse markup [type=CF_TEX]

    ways. Suffix of last (n - i) elements forms a permutation.

    Then we must merge these two permutations together by merging all elements except maximal n together. This can be done in ways.

    Then the number of bad permutation is count of all [n] permutations minus good permutation count;

    answer = n! - good_perm_cnt

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

This round must be rated

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

Hi, I submitted A (incorrectly) just before the website crashed, and I had to waste about half an hour waiting for it to come back on. As a result, my A was submitted 30 minutes later than it should have been, and my rating will likely fall is a result. Can this contest be unrated for me?

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

Actually I finished coding div 2 C in 32-33 mins mark. I was about to submit and the site went down then. I tried to submit for for the next 20-25 mins but coudn't due to the issues.

Also, the site was down and up,down and up at least until the 1.15 mark, and I managed to crunch in a submit during the 2-3 seconds the site was working between the lags around the 58 min mark.

And I see some people have already submitted on 28-29 mins mark. I guess this is kinda unfair.

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

Rated Please

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

Second consecutive contest of codeforces that is very bad :

  1. not clear question

  2. bad pretest and anyone can hack easily

  3. Bad Gateway

Why ?????

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

    it was not bad really . problem were pretty clear and pretests were not too weak . i was busy coding div1 B for almost the whole contest so i didnt get that gateway error at all ! however hacking was almost impossible

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

    Actually it was a good contest except the bad gateway problem. Problem statements very fairly clear and some hacks are always expected in div2A.

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

      That's right. but those could be very better. codeforces is a good and popular site as a result anyone have high expectations.

      I hope codeforces be better in the future like always! :)

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

Great contest plagued by server issues :(

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

I was unable to hack in the last 6-7 minutes, but still, let's not make the round unrated. Even the last rated round was unrated. Looks like, system issues are becoming rather common, so this way, who know when we'll have an actual rated round. Please don't make it unrated.

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

How to solve E? f(1, x) can be computed in O(log2), I'm not sure it has anything to do with real solution, though. I tried some randomization stuff but couldn't pass pretests.

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

    I thought of the same thing (you're using the fact that X halves or stays the same at each step)? You can also do something like: "if (a[i] <= a[i + 1]) delete a[i + 1] and increase the coefficient of a[i] by 1" and you get a decreasing array, with some extra coefficients. Still not very useful though:(

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

      Yep, I did both of them but they were'nt very useful :(

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

I hope they consider making it rated for those with positive rating gains and unrated for those who lose rating (as they've done in the past). This could satisfy everyone?

Edit: I don't understand why a reasonable suggestion is being downvoted.

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

    That's a good idea. emmm....

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

    nah, the rating inflation will be skyrocketing if that were the case.

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

      Well, they've done it for a few contests in the past and it seemed to meet most people's demands.

      → Reply
»
7 years ago, # |
← Rev. 5   Vote: I like it 0 Vote: I do not like it

My attempt on E (Div 2.):

We will construct a permutation that has the following structure: Starting with a values, then place the value, namely false_max, that will be the answer of fast_max() procedure, then k values after that, then the rest of the number. Note that the first a + k + 1 elements in this array will be <= false_max. The number of choices can be decomposed into:

  1. Choose (a + k + 1) elements from the set of [1, 2, ..., n-1] -> the answer is combinations(n-1, a + k + 1)

  2. Place the maximum element, false_max, from the above step at array[a + 1].

  3. Re-arrange the remaining numbers of the chosen elements into (a + k) spaces -> the answer is (a + k)!

  4. Re-arrange the remaining not-chosen numbers into (n - a - k - 1) spaces -> the answer is (n - a - k - 1)!

That is for one a. a will be ranged from [0, n - k - 2]. Calculate the sum of all intermediate values gives the final answer.

Here is the pseudocode:


  long long answer = 0;
  long long mod = 1000000009;
  for(int a = 0; a <= n - k - 2; a++) {
    long long temp = mod_fac(n - a - k - 1, mod);
    temp *= mod_fac(a + k, mod);
    temp %= mod;

    answer += temp * nCk(n - 1, a + k + 1, mod);
    answer %= mod;
  }

I got Wrong answer on pretest 15. Is there anything wrong with my solution, or just that my implementation is so poor that it can't handle the mod part?

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

    Oh wow what a coincidence, we posted the same wrong solution at the same time!

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

    "temp *= mod_fac(a + k, mod);"

    its actually not (a+k)!, since in the first a numbers there must be no k consecutive decreasing values, otherwise you will stop at them and not reach the a+1th value.

    to calculate this number, let dp[i] be the number of ways to permute first i numbers such that no k are increasing. dp[i]=(dp[i-1]/(i-1)!+dp[i-2]/(i-2)!+...+dp[i-k]/(i-k)!)*(i-1)! (i is from n-k to n-1)

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

      Can you please explain this dp? I struggled for the whole contest to find this.

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

        Let's find dp[n]. Obviously, you can place the number n only in the last k spots, otherwise you would have more then k numbers smaller then n after n. Lets say you place number n at position i (so you have i numbers, then n, then n-i-1 numbers) (n-k<=i<=n-1). The first i numbers also have to respect the condition (of no k decreasing consecutive numbers), so there are dp[i] ways of arranging them. Also, there are C(n-1,i) number of ways of choosing the first i numbers out of the n-1 other numbers. We can arrange the last n-i-1 numbers in any way, since n will be bigger then all of them, so there are (n-i-1)! ways. Final formula:

        dp[n]=sum(dp[i]*C(n-1,i)*(n-i-1)!)=sum(dp[i]*(n-1)!/i!)=(n-1)!*sum(dp[i]/i!), where i is from n-k to n-1

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

    I think your problem might also have overlap issues. Consider the step when n = 10 and k = 1. For the permutation {1,2,4,3,5,6,10,7,8,9} and a=3 your solution would consider false_max=5, whereas the false_max should've clearly been 4.

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

How do you solve problem E? I got WA on test case 15 with this formula so I want to know if the formula was wrong or if it was something in my code.

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

    For example: n = 5, k = 1 You will count this permutation twice: 2 1 4 3 5

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

Hacks for Div 2 a?

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

    Many people checked sum/2. It get WA when sum is odd.

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

    one guy in my room checked d+e+f == c+d+e. Hacked.

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

    for who used sum/2 for checking ... 1 1 1 1 1 2

    for sorting and then grouping (0,1,5) — (2,3,4) ... 0 1 3 4 7 7

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

    There was a solution in my room which checked a[0]+a[4]+a[5]==a[2]+a[3]+a[1]. I hacked it using 1 6 7 9 10 11. Several other hacks are possible.

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

All right, go rated

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

What is the reason of this server break downs? Poor servers, DDOS or smth? Can anyone explain it?

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

How to solve Div2-D (Div1-B) ?

It'd be nice to give hints before the complete solution.

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

    Hint : Will the result contain a character more than once ?

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

    implementation

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

    is there is a solution if a character occurs twice in a string?

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

    solution will be a forest of linear trees

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

    Well i couldn't solve Div 2 D but here are some of the things that i had thought of during the contest. If someone has solved with similar assumptions then please help in how to construct a solution from here.

    1. final answer will contain each character once so length <=26
    2. if any of the input string and all its sub strings are disjoint from the other strings or their substrings then we don't have to worry about it and can simply append it to the answer.
    3. (The hard part and from here im blank) I need to find a way such that an input string joins at the either of the ends of another string or merges in the middle. final answer will be this string along with the disjoint strings appended.

    Can anyone help me create a solution from here or if my assumptions are wrong then point em out please? Thanks :)

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

      Construct from strings graph symb -  > nextsymb. This graph must be:

      1) uncycled;
      2) from each vertex there must be at most one edge;
      3) to each vertex there must be at most one edge.

      So from that graph you must iterate over vertexes that have no one edge points to them and create answer.

      Example:

      ab
      bc
      cd
      da
      Answer is NO since graph a->b->c->d->a is cycled.

      kas
      kad
      Answer is NO since from a there are two edges to s and to d.

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

        Thanks for this but i dont quite understand how the graph is being made. Can you please explain for this input

        2
abc

xyz

        Thanks! :') Update: I've understood thanks!

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

      Here's how I did it (With the same assumptions as you did): - Put in all the strings in a set S. - If any string has a repeating character, print NO(since this character will have more counts than the entire string). - For every character c in the alphabet, do the following: Make a set of all strings that contain this letter, say T, and while the size of this set is larger than 1, pick two strings from this set, merge them, and insert result in the set S. (Remove the original strings from S and T) If it is not possible to merge any two strings, then print NO (because the final answer has any character appearing atmost once.) To merge any two strings, check the prefix and suffix from c's position in the two strings. - Finally, you have only disjoint strings remaining in the set S. Concatenate them lexicographically and do a final check for repeating characters.

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

        suppose if the set is ab, ba then i can construct the string abba, in which all the substrings in the set occurs once and all occus exactly same amount of time. Also if it is kas and kad then kaskad is a good string right ?

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

          No..Because occurence of k is more than occurence of kas and kad.

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

        Wonderful explanation !! Thanks a lot :)

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

Lagforces servers be like

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

Let's run the system test, if i passed the D the round should be rated.

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

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

Some of us have problem with the round being rated. Because if the server wasn't down, we could have submitted our code early. But as CF was down for approximately half an hour, we got huge penalties :( which will brutally decrease our rating. If we could submit codes just in time, our rating would not be this massacre. So please make the round unrated. :(

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

CF server trying return

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

Let's run the system test. For one I'd like to know if I messed up on div. 2 ABCD. For another, I really wanna upload my updated version for problem F just to see if I did it correctly lol

Either rated or unrated, the system test shall run lol

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

I do not care if this contest is rated or unrated. I only wish discovery test case 4 for D.

UPDATE: Got AC with this case.

→ Reply
»
7 years ago, # |
  Vote: I like it 0 Vote: I do not like it
  1. I don't know why but i cant see round #445 in the contest page.
  2. System Tests have still not started. Do they usually take this much time or are the setters trying to figure out whether to make the round rated or unrated and if rated then how
→ Reply
»
7 years ago, # |
  Vote: I like it 0 Vote: I do not like it

How to solve DIV2 D ?

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

    Construct a directed forest as follows. Nodes are letters. If one letter right after another in one of the words, then there is an edge from the first letter to the second one. There must be as most one outgoing edge and one ingoing edge on every node, otherwise answer is NO.

    Tricky thing: some words have only one letter in it, one should care about that.

    Once you have a valid forest, just print the letters in the order given by the forest.

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

      Yeah, you also need to make sure there are no cycles; as an example, the answer for

      2 ab ba

      is NO

      and the answer for

      1 aa

      is also NO.

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

Codeforces became one of the most searched today websites on websitedown.info!

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

it hurts when you expect a positive rating and the round ends being un-rated.

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

    i got a notif that its undated :( Please make it undated but not unrated ;_;

    On a more serious note, how to unregister my account? I don't wanna come here anymore...

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

      Or you can just not visit the site, instead of unregistering the account altogether. As for receiving mails regarding contest announcements, you can just unsubscribe them. Is this idea that difficult to come up with?

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

        Actually I had to make a choice : 1) write a lot of true and bad things about the situation, 2) show anger and protest subtly.

        Is this that difficult to see that yourself :)

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

My story on problem A:

  1. Thought one couldn't stay on one vertex twice.

  2. Got WA

  3. An announcement said something like "1->1->1 is invalid because of t_2 can't be equal to 1". Thought it meant "because you can't stay on one vertex twice".

  4. Never questioned my understanding, found that I couldn't pp, and gave up.

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

    You could have seen in the explanation for example 1 they give 1 -> 1 -> 2 as a possible solution.

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

    I misunderstood the statement and tried solving a slightly different problem-

    On visiting a vertex the second time, any integer between [last_visit_time, i) can be written on that vertex.

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

Rated round:

Unrated round:

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

Wut, noo, now I can't make round 446 :(

→ Reply
»
7 years ago, # |
← Rev. 2   Vote: I like it +24 Vote: I do not like it 
if(rank==good)
    cf="UNRATED";
else
    cf="RATED";
→ Reply
»
7 years ago, # |
  Vote: I like it +10 Vote: I do not like it

In Div1C
I needed to calculate number of permutations p1, p2, ..., pn satisfying .
On Oeis it said that this is equal to the number of permutations where all cycles have size less than or equal to K.
I tried proving both these conditions are equivalent but found a

Counter Test


Does anyone know why these two set of permutations have equal size?

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

    Think about it this way. For your condition tu hold, the value n must within the last K positions. And you can choose the following values in ways, where is length of the suffix starting in value n. Then you have to multiply by the number of good permutations of size . That is, . This is exactly the same as choosing a cycle for element n of size at most K, and then multiplying by the number of good permutations for the remaining elements.

    I'm not sure if I understood what you mean by counter test. It's true that the permutation you show should be counted as good for the problem statement, but it does not comply with the condition you mentioned.

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

although there where a lot of technical issues and despite that i spend more time reloading pages than the time i spend on reading problems, it was one of the greatest contests i ever participated in,thank you for your efforts it was totally worth it to participate even though it wasn't rated in the end.

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

I have given up on the contest when there was more than an hour left and almost got to top 100. Suspicious.

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

How many participants from this round will be chosen to the final?

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

Some Div.2 solutions using regular expressions (in Perl): A — 32278803, D — 32280926.

→ Reply