Vladosiya's blog

Codeforces Round #925 (Div. 3)
By Vladosiya, history, 9 months ago, translation, In English

Hello! Codeforces Round 925 (Div. 3) will start at Feb/13/2024 17:35 (Moscow time). You will be offered 6-8 problems with expected difficulties to compose an interesting competition for participants with ratings up to 1600. However, all of you who wish to take part and have a rating of 1600 or higher, can register for the round unofficially.

The round will be hosted by rules of educational rounds (extended ICPC). Thus, solutions will be judged on preliminary tests during the round, and after the round, it will be a 12-hour phase of open hacks.

You will be given 7 problems and 2 hours and 15 minutes to solve them.

Note that the penalty for the wrong submission in this round is 10 minutes.

Remember that only the trusted participants of the third division will be included in the official standings table. As it is written by link, this is a compulsory measure for combating unsporting behavior. To qualify as a trusted participant of the third division, you must:

  • take part in at least five rated rounds (and solve at least one problem in each of them)
  • do not have a point of 1900 or higher in the rating.

Regardless of whether you are a trusted participant of the third division or not, if your rating is less than 1600, then the round will be rated for you.

Problems have been created and written by our team: myav, Gornak40, senjougaharin and Vladosiya.

We would like to thank:

  1. MikeMirzayanov for help with ideas and Polygon and Codeforces platforms.

  2. nigus for red testing.

  3. vladmart, Gheal, KseniaShk for yellow testing.

  4. htetgm for purple testing.

  5. natalina, SashaT9, lockdown, bma20006 for blue testing.

  6. RedDreams for cyan testing.

  7. the_Incharge, Aurora__, Longqiang for green testing

Good luck!

P.S. Happy Valentine's Day!

UPD: Let's continue streak of announces with photo of the authors :)

UPD2: Editorial

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

»
9 months ago, # |
  Vote: I like it +24 Vote: I do not like it

Wow, you put a lot of effort to make a lot of quality div3. Thanks for a lot good div3 round to help beginner to advances in CP.

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

$$$\mathtt{Thanks \ for \ Legendary \ Div.3 \ Rounds , Looking \ forward \ to \ join \ the \ authoring \ forces}$$$

→ Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Yeahhhh!!! Div 3 Letsssss Gooooo

→ Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Div 3 are my favourite. Lots to learn.

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

the round number and date is wrong please fix

→ Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

the round and date are wrong

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

speedforces let's go

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

Thursday, October 12, 2023?

→ Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

I hope this is my last round before cyan

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

Thank WHO for red testing 😳

→ Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

My first unrated Div3 I mog everyone

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

Excited!! Hoping to reach pupil this time :)

UPD : FINALLY REACHED :)

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

don't make your gf sad, prepare gift after contest

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

    cp and gf? nah man something doesn't feel right. Just don't touch grass and stay home I guess

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

I had no idea authors could be so pretty. I'm blushing (,,>﹏<,,)

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

    mmm, why?

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

      I was hoping the authors would see it and feel happy.

      Spoiler
      → Reply
      • »
        »
        »
        »
        9 months ago, # ^ |
          Vote: I like it +3 Vote: I do not like it

        No, I mean why you thought that authors couldn't look pretty. As far as I'm concerned they're all human beings, just like the rest of us

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

          If I became an author, I would be a good counter-example :)

          But you are correct. Everyone is beautiful. That's why its great to have pictures of the authors in the announcement.

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

so sweet post. Happy Valentine's Day. Do spend time with ur loved ones, instead of attending contests

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

Can you pin social media handle (Instagram) of girls in image, i need tips for CP from them :)

→ Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

I am the one in the button right on Valentine's day :⁠,⁠-⁠)

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

I don't get it,why are authors making a 'C' with their hand?

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

    May be because Mike also did the same on his picture (to hold the burger)?

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

    It's not the letter "C", it's half a heart (we tried, ahahah) We wish the community a happy Valentine's Day!

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

      Got it,that makes sense,i need to go out and meet some real people.

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

Thanks for the contest but why y'all throwing up gang signs?

→ Reply
  • »
    »
    9 months ago, # ^ |
      Vote: I like it -14 Vote: I do not like it

    Bro failed to get some contribution XD

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

      Lol, at +116, even 100 upvotes on this comment won't change my contribution at all

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

Valentine's Day ? Oh man, i am CPer

→ Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Wow, this is great.

→ Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Looking forward to it!

→ Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

My first unrated contest

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

They are so similar

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

why are the names of the authors written in reverse

→ Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

I really hope to become Pupil in this contest.

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

Hopefully my last rated div3

→ Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Wish everyone will have a good score!

→ Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

why the solution will be out 5 minutes before the contest ends?

→ Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Hope positve delta for all rated participant.

→ Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Finna reach 1000 elo ;))

→ Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

I'm really looking forward to the Codeforces contest taking place tonight, on the fourth day of the Lunar New Year. It's an exciting opportunity to challenge myself and improve my problem-solving skills！

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

→ Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

NOOOO THE CONTEST END 10 MINUTES AFTER MY OLYMPICS(school)

→ Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Good luck to everyone.I hope to become expert on this round.

→ Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Hoping to solve atleast 2 problems this contest

→ Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Iam ready to solve just one problem As usual

→ Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Thank you

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

Hope to reach expert again

→ Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

hope to be specialist,,if i could solve E, my day will be great otherwise it gonna worse,,,

→ Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

I give up more than an hour trying to figure out B and its just not working

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

    same here... i dont know what are the mistakes i am doing as A,B,C all the three questions are very easy

    → Reply
»
9 months ago, # |
← Rev. 2   Vote: I like it -13 Vote: I do not like it

Disgusting problem F

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

    It's not, F is basically "Detect cycle in a directed graph".

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

    you can do "F" just by making first line as 1, 2, 3, ... n, and these ai changes in next k — 1 lines too.

    Then for each line just check order is maintained (i.e. curr element is less than last)

    As an edge case: ensure "1" is correct in all.

    submission

    → Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

I absolutely clutched problem E with 10sec remaining!!

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

Got the right idea for F about an hour after the contest started but spent the next hour debugging double-hash. :(

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

    Hope no one tries to hack me after I write this comment. :(

    → Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

please hint for C

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

    Try to fix equal element, either equal element can be first element of the array or last. Then find the range i and j

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

    You MUST choose x as the first OR the last element.

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

    three possible ranges you will select from k to n , from 0 to n-k , or from i+k to n-k. k is the index is where there's no more duplicates from the beginning or end from the array, like [1,1,1,2,3,4,5] k is at index were ai is equal 2 , so we can make the range we select [4,7] , same from the back. i+k to n-k is when the duplicated at front is the same from the back . sorry for bad explaining

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

      i did that but test case number 2 gives WA 246226405

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

        Same problem, everything seems right still tc2 shows wrong, 112th answer being wrong by 1.

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

    You can look for the longest segment of equal elements from the start, let's call it a, and the longest segment of equal elements from the end, call that b. Now, there are two cases:

    (1)If the first and last elements are equal, you can choose the contiguous segment of elements not in either a or b. (notice, if len(a) + len(b) > n, the answer is zero. Else the answer is n — len(a) — len(b))

    (2)If the first and last elements are not equal, you choose the equal element as the element that comes in the longer segment. (notice, the answer in this case is n — max(len(a), len(b)))

    → Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

The CloudFlare feature is really a shit ,can't submit the solution even after doing it

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

i am annoyed i couldn't get F i didn't think it will be cycle detection at all.

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

Problem D is nice, thanks for the contest. But how to solve F?

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

I feel like idea of F was simple but the implementation was tedious. Also, loved G!

→ Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Any hints for G?

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

    Try reducing this problem to a stars and bars problem Try to think what are the prerequisites if we want to place the 4th block at any place same goes for the 3rd Think which blocks are the limiting factors and which we can take care of irrespective of their quantity Have a Great solve!!

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

Maybe it's just me, BUT F seemed way easier than both D and E, although didn't spend much time on E after I saw F, which I had just the right idea for. Overall very fun Contest.

→ Reply
»
9 months ago, # |
← Rev. 2   Vote: I like it +25 Vote: I do not like it

Quick hints for all the problems before the Editorial comes out.

A: Just brute force on each index using 3 for loops.

B: As the water can't flow backward, therefore the amount of water in any prefix can only decrease or stay constant.

C: Check if all equal, else count prefix equal length and suffix equal length.

D: What if we store the remainders in pair<int, int>?

E: Replace each number by the count of its trailing zeroes, now play the game greedily.

F: We can easily create the order from the first 2 arrays given (if k = 1, then its YES). Just make sure to handle one edge case [1,2,3,5,4] and [2,1,3,5,4], basically those in which there are 2 possible orders)

G: Pieces 1 and 2 can only appear alternatively, and the pieces 3 and 4 will always fit in the between their occurences. Also, pieces 3 and 4 can be repeated, while 1 and 2 can't. Try fixing Piece 1 or 2 as the first piece in the chain, do you get some general pattern?

Spoiler
→ Reply
  • »
    »
    9 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Simple way to do F

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

      Easier way to solve F without using graph

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

      Yeah this subproblem looks way more easy and familiar, I was just hasty and went with my first thought.

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

    In F, I think the simplest way to code is model it as a graph and use topo sort. I think that makes implementation really easy with template :)

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

      F feels like AtCoder style problem, doesn't it? :)

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

        I think it's more like the first few problems of a regional.

        → Reply
  • »
    »
    9 months ago, # ^ |
    ← Rev. 5   Vote: I like it +1 Vote: I do not like it

    can up please tell what's wrong with this

    code
    → Reply
  • »
    »
    9 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    I did F after constructing the graph and checking if the number of SCC is equal to $$$n$$$:)

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

      can someone define the statement in a prettier manner? I can't understand that. I know how to do cycle detection but the statement itself is unclear.

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

F — "Detect cycle in a directed graph."

Submission- 246203312

→ Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

can anyone share any hint for problem D?

→ Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

How to combine pieces in the second test case of problem G (one sample way would be enough, please)?

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

    121212121244 or 121244121212

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

      Hmm, but there are only 2 pieces of type 2 and single piece of type 1: c = [1 2 5 10]

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

        Sorry I misread it as second last test case, for the 2nd tc, here is one,

        333332124444444444 or 333332444444444412

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

          Thanks! Now I see why I could not solve the problem :)

          → Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

I just wanna say thank you for making this contest, I was able to solve till F( can't believe I did this )

I think I have very unique solution for problem D: Problem D Solution

I used modular operations for storing single value in map

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

    I did not get the logic behind your code. int v = mod*a + b ; int fv = mod*fx + fy ; why did you do this?

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

      For pair $$$(a,b)$$$ we interested in pair $$$((x-a)\mod{x}, b)$$$

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

      this is a trick,

      for representing two number in single number,

      lets a , b are the numbers i want to encode it into one number, then i will choose mod > max( a , b )

      then encoded_number = mod*a + b

      when you want,

      to get b = encoded_number%mod ;

      to get a = encoded_number/mod ;

      so with one encoded_number i have stored two values

      EDIT: fixed formatting

      → Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

just 3 again

→ Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Code editor is not working, keeps running and no result, makes the whole experience shit. Cant run test cases.

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

How to solve G: https://chat.openai.com/share/3647110d-401a-4591-9dda-840260a0317d

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

    you just calculating binomial coefficient, how is this related to solving G?

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

      Because the only thing that came to my mind was:

      • place a 3 on this group (between 1 and 2),
      • or move to the next group

      which led me to the formula: $$$dp[i][j] = dp[i - 1][j] + dp[i][j - 1]$$$, and I didn't realize that it was effectively just comb(i + j, j), so that's what ChatGPT told me.

      → Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

https://codeforces.net/contest/1931/submission/246186250

The best solution to hack:)

→ Reply
»
9 months ago, # |
← Rev. 2   Vote: I like it +14 Vote: I do not like it

Here is how you can choose the next type of element to add in problem G.

Two nice observations:

  • This condition must be satisfied: $$$\left|c_1 - c_2\right| \le 1$$$.
  • Think about the problem without elements of types $$$3$$$ and $$$4$$$, then try to insert them in the generated chains.
→ Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

When I saw other's solutions,I found the problem E very easy. However,I think F is easier than E because I can get the idea to solve it without thinking.(if you know something about graph)

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

    I agree. I knew immediately I could use Khan's algorithm to solve F right after I read it. But the strategy for E took me some time. (and I solved F before E)

    → Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

I was wondering whether this contest gives any rating? I am 401 rated. I have participated and solved 2 problems but haven't got any rating. Can anyone tell me if i'll get any rating?

→ Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Does the following work for F?

Rearranging any of the participants except the last one cannot change the last participant from the permutation. Therefore, we can find the real permutation by checking which one has the last participant only once. Now, that we have obtained the real permutation, we can compare all of the k inputs to the real one and check.

This doesn't work when k == 2 but in that case we can simply check subsequences ignoring the first two numbers.

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

    Better Idea:

    Simply Ignore the first Position of Every observation. Take an edge pointing from v[i] to v[i+1] (1 <= i <= n-2) for Every participant observation.

    Check for the cycle in the graph, If the cycle exists then NO else YES.

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

      How to check if a cycle exists? I tried doing it using DFS but it exceeded the time limit.

      246185460

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

        check this blog detect cycle in directed graph

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

          Thank you!

          → Reply
          • »
            »
            »
            »
            »
            »
            9 months ago, # ^ |
            ← Rev. 4   Vote: I like it 0 Vote: I do not like it

            TLE coz of MAX maybe, You are unnecessarily assigning 2e5+7 values to the array, even when N = 1.

            Just imagine for the test case where t = 10^4 and N for each case belongs to {1,2,3,4,......2e5}, even if k = 1.

            As this test case fits under the given constraints, You will be doing 2e5*(1e5)/2 roughly around 1e10. That's y.

            I think so, I can be wrong.

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

              Yeah, I think that was the problem. I just resubmitted resetting only n values and it got AC. Just missed it during the contest :(

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

    246262272 Maybe hashing was unnecessary, also who knows if this might get hacked.

    → Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Loved the beautiful Stars and Bars problem (G) Got to the solution but didn't submit earlier as I was unsure if it would be rated for me Nonetheless Here's my solution in case any one wants a reference: https://codeforces.net/contest/1931/submission/246256160 :)

→ Reply
»
9 months ago, # |
← Rev. 3   Vote: I like it 0 Vote: I do not like it

As an expert I failed D: TLE on test 9. Here is my code: 246198274. Could anyone help me with debugging? I think this is O(nlogn).

Edit: This is O(y). Forget it

→ Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

How to solve E? Didn't get any idea at all :(

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

    1) Ans "yes" if number of digits in the last number >= m + 1. Anna in each step tries to reverse number with maximum zeroes on the end. Sasha in each step does concatenation number with maximum zeroes on the end with any number without zeroes on the end (number without zeroes on the end is guaranteed to exist, since it either exists initially, or Anna will make it her first move)

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

    it is optimal for both of them to the choose the numbers which have most no. of zeros at the end

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

    multiset<pair<trailing_zeroes, digits>> and just model a game

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

    you can simulate it as follow: for anna reversing a numbers is equivalent to deleting the trailing zeros so she should take the number which have the most trailing zeros every turn for sasha she will also choose the number with most trailing zeros and concat it with any number (it doesn't matter but we can choose the second most number having trailing zeros for implementation purpose) by doing this it save the trailing zeros in the largest number so anna can't remove them by reversing the number thats it u can keep track of the numbers having most number of trailing zeros using a priority queue and update it each turn accordingly

    → Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

This is my first AKed competition, and the problems were wonderful and quality, thanks! I like G best, it's an interesting counting problem.

→ Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

FUN QUESTIONS, Extremely challenging but really good questions.

→ Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Can someone please help me in Problem C?

I am not getting why it gives me wrong answer on test case 2 (112th answer in tc2 is wrong it says, and I am not able to see what that case is because after certain lines the input of test case just shows "...")

Here is the submission —

246248784

Thanks!

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

    I dont know python so I apologize if I am wrong but if first and last element are equal then the ans should be 'n-(s+e)'

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

      yes so in python ".strip()" will remove all occurences of the passed argument from the front AND the back ONLY(not in the middle). So that part works alright.

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

        Have you considered striping the last part too?

        → Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

I think you should reduce the time limit of this problem. this submission -> https://codeforces.net/contest/1931/submission/246247517 runs in 1 second. this submission should not get AC because # of testcase is 10000 and this submission is executing a for loop of 200005 every test case. that's more than 2e9 operations.

→ Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

!What is this submission code
is he know the testcase?

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

    it's hacked

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

      Yes but how did he AC in the first place?

      → Reply
      • »
        »
        »
        »
        9 months ago, # ^ |
          Vote: I like it -22 Vote: I do not like it

        testcases were week

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

          Oh no, we didn't make tests with all possible t value! What a weak testset!

          → Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

After successfully wasting 1.5 hour on B i smashed binary search in B

can someone hack it?

246247536

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

    why would you even think of binary search . you already know that the good value is sum/n . that's the only way you can make tha array the same

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

      yeah i am dumb. do not know why that did not come into my mind

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

        same here I thought of every thing in this life except that the only possible number is sum/n by the way I wanted to do binary search but I didn't know how to handle the good function but I learnt that from you now I mean the 1 , -1 and 0

        → Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Video Editorial for problem B (Audio : Hindi) TUTORIAL VIDEO LINK

→ Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Is this hackable B ? 246258951

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

    I don't think so.. I used a similar approach so.. I hope it is not

    → Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Thanks to the authors for an interesting div 3 without clay and with tasks that are fun to solve. After this div and the Cognitive Technologies Olympiad, I realized that the name Gornak in the list of authors => good Olympiad/div.

→ Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Can G be solved using inclusion exclusion ?

→ Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

May I ask why I passed 3 questions but didn't receive a rating in the end? Or who should I seek help from? I really want this rating, thank you.

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

    Rating appears after 1 to 24 hours from the end of a contest, and if there is a hacking phase, like this contest, then it may last up to 24 hours or less.

    → Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

in Problem E , i wrote code which was absolutely right, the only thing i missed was, if number>=10^m then number of digits should be >=(m+1) not >=m (it was pretty close :) )

→ Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

I submitted E when there were 10 seconds for the contest to finish and my submission got vanished...

why so ?

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

In Problem C anti hash test case can be created as many unordered map solutions have been accepted.

→ Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

How to solve Problem G?

→ Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

wow that was very cool

→ Reply
»
9 months ago, # |
← Rev. 4   Vote: I like it 0 Vote: I do not like it

A different way to do F:

  • Each element (after the 0th element in the kth list) can only be it's current position or its current position+1

  • Store both possibilities in a vector

  • Remove possibilities for elements when they're no longer possible (i.e. the current element's position in the kth list conflicts with the elements position in a previous list)

  • The answer is no if an element has no possibilities, or if its only possibility conflicts with another elements only possibility

  • Otherwise the answer is yes

Code: https://codeforces.net/contest/1931/submission/246250979

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

I am getting wrong on test case 3 for problem E

My approach is " The first set contains numbers with leading zeros, while the second set comprises numbers without leading zeros. Within a while loop, the first element of the first set is removed, and its length is added to the second set. Additionally, the first value of both sets is combined and inserted into the second set. The game iterates until the first set is empty. Afterward, the sum of the lengths in the second set is calculated. If this value exceeds a specified threshold, Sasha wins; otherwise, Anna wins.

can anyone help me find what's wrong in this?Solution link

→ Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

really enjoyed this contest, particularly problem D. start to see some common patterns on int-mod problem..

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

my respect to Aleksander Gornak

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

I was getting runtime error (STATUS_ACCESS_VIOLATION) in E, during contest , but after contest when i submitted same solution it got accepted . runtime error during contest code link.
accepted code after contest. Thanks

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

    The problem is this for loop here: for(ll i=vect.size()-1;i>=0;i-=2).

    In C++, the return type of std::vector::size is an unsigned integer. When vect is empty, then vect.size() - 1 becomes 0 - 1 which then overflows to UINT_MAX. This causes out of bounds error which is why your program got runtime error. (It seems that this is changed in C++20, which is why your other code got accepted)

    To fix this, you just have to convert vect.size() into any signed integer type. For example for(ll i=(ll)vect.size()-1;i>=0;i-=2). New code

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

Video explanation of Problem G (Chinese)

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

One of the best rounds I've ever participated. Thanks to all the writers and testers for offering us such a round.

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

The best div3 round contest I've ever participated!Thank you!

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

when will the rating come out?

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

    you need to wait that the system testing ends first (is around 80% right now). after that eventually the rating will be updated.

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

      Oh,Thank you.This is my first time to attend CF.(I find out my G turned out to WA,It used to be AC)

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

        I saw it as a AC, when the system testing is running and your AC code is still on queue, if you had a WA before the AC, you will see as if you get a WA. So congrats on your first contest participation in CF was really good!

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

        First CF got G AC,congratulations!

        I'm waiting the rating, too.

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

        Thank you for your encourages!

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

Can anyone tell me where have I made a mistake in these two codes? Only difference I have made from my side is making the capital N,small n? Basically I had initialised all visited array elements to zero in reset function. Thankyou in advance.

1st submission 246198873

2nd submission 246233252

→ Reply
  • »
    »
    9 months ago, # ^ |
    ← Rev. 5   Vote: I like it +1 Vote: I do not like it

    I don't understand why exactly gives you another answer (actually I'm more curious of how didn't get you RTE hahaha weird stuff)

    But the reason why the change works is because in the WA submission, you have the following code:

    vi g[N];
void reset(){
	fr(i,0,N){
		g[i].clear();
		vis[i]=0;
		vis1[i]=0;
	}
}

    and fr is #define fr(i,a,b) for(int (i) = (a); i <= (b); (i)++)

    So, the cycle in reset() will access to the position $$$N$$$. But the arrays g, vis and vis1 are of size $$$N$$$, I change you code putting a -1 and now it gets TLE, that makes a lot of sense, because $$$t = 10^4$$$ and $$$N=2e5+69$$$, so you will do around of $$$2\cdot 10^9$$$ operations just to reset.

    → Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

In Question 4 this code exceeds time limit on test case 33 cant understand why its o(n) approach can someone please help me?

include<bits/stdc++.h>

using namespace std;

define ll long long

int main() { 

int t;
cin >> t;
while(t--)
{
    ll n, x, y;
    cin >> n >> x >> y;
    unordered_map<ll, ll> dp;
    ll a[n];
    ll ans = 0;
    for(int i = 0; i < n; i++)
    {
        cin >> a[i];
        ll f = (x - a[i] % x) % x;
        ll l = a[i] % y;
        ans += dp[f*y+l];
        dp[(a[i] % x)*y+a[i] % y] += 1;
    }
    cout << ans << '\n';
}
return 0;

}

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

    Same happened with me many times... :(

    Its because of unordered_map if you use simple map it will pass....

    For more: https://codeforces.net/blog/entry/62393

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

    Worst case time complexity of unordered map is o(n) while normal map is of o(logn) that's why it is giving Tle. I got AC with your solution by just changing unordered map to normal map

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

But may I ask why I still haven't received a rating? It should have been a long time since the hack phase ended. I really want the rating for div3 this time, thanks.

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

    You must wait for some more hours after the system test. Codeforces needs time to calculate rating changes. Just chill

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

Why there is no rating change? My rating is less than 1600

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

    It takes a while after the system test for codeforces to remove cheaters and recalculate the rating changes.

    By the way, have we met somehow before?

    → Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

can anyone just tell me which are valid patterns in G? I can't find any for 1 2 5 10

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

    One of the valid sequences is:

    2 4 4 4 4 4 4 4 4 4 4 1 3 3 3 3 3 2

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

      Thank you... I didn’t notice self loops.

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

when it will be rated?

→ Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

All my submissions have been blocked due to one answer(246237190) for question 1931F being very similar to the ones given by two other people.

One of them is from another guy studying in my institute who happens to study from the same materials and has given similar contests, hence the answers are very similar. Please review it and I hope my submissions are considered.

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

    This clearly is a very repeated question, since many people have the same solution Please review it once.

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

      It is very clear that You have copied this code 246237190 from somewhere, you didn't even put the effort to indent it properly. I think it is justifiable to get blocked.

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

        So your justification of me getting blocked is the code not being indented

        i was in a hurry, thats it

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

        You know what Leave it, you and I both know how much ever I fight there isn’t going to be any change I better focus on future contests, even if they unjustly block me again I will create new account and start again

        → Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it
Key observation of problem E!
→ Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

I am new to code forces this is my first contest, I have solved two questions still didn't get any rating. Did I miss anything?

→ Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Hi, I participated in 925 and it wasn't rated for me, does anyone know why? I am < 1600 (878).

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

Give me my rating pls((

→ Reply
»
9 months ago, # |
← Rev. 3   Vote: I like it +4 Vote: I do not like it

Finally blue. Was a great experience.

→ Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Hi I attended this contest and I solved problems A & B and got D wrong. And i'm not able to find the constest under my contests and my rating afterwards didn't although I am under 1900. Can you please explain why my rating did not improve?

→ Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Become a pupil from this contest.

→ Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

I am sorry for using a code snippet that is used by lot of other people. This made me into this trouble of making code solution identical to other users. I regret using this snippet now. I shall prevent myself from further using this snippet anymore. Sorry CF ...

→ Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

why aren't the ratings changing ? Its been 2 days

→ Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Hello respected judges,

My code was accidentally matched with the other participants. I have no idea about this rule of the CodeForces of contests. I didn't know this before. I had no selfish intention to do this cheat of any type. That participant is my college friend, and we discussed not exactly but similar type question before this about how to solve it. But I didn't know how we both accidentally write up the same code.

So, please can you give me my rating back, in future I will take care of it and not publish my code publicly anywhere.

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

    You mean your rating reduced?

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

      No, my rating has not increased. My solved question which matches with others was skipped means not considered for evaluations.

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

    lol

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

      Happy Birthday to your alt account, just 2 minutes before re-registering on Codeforces. And hey, you're new here, aren't you?

      → Reply