RedMachine-74's blog

Codeforces Round 954 (Div. 3)
By RedMachine-74, history, 6 months ago, translation, In English

Hello! Codeforces Round 954 (Div. 3) will start at Jun/23/2024 17:50 (Moscow time). You will be offered 7 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.

The tasks were created and prepared by 74TrAkToR. I would like to thank everyone who helped me a lot with round preparation.

Good luck!

UPD: Editorial

UPD: Video Editorial

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

»
6 months ago, # |
  Vote: I like it -14 Vote: I do not like it

OMG 74TrAkToR!!!!

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

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

Are you sure this is Codeforces?

It might be:

  1. Mathforces

  2. Algoforces

  3. Codeforces

  4. Interactiveforces

The question asks you to upvote and answer :D

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

Div 3 doesn't feel like Div 3 when 74TrAkToR is author

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

As the problems change and adapt, we too must become more vigorous and evolve into more superior problem solvers

⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⣠⣤⣤⣤⣀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣀⣀⠀⠀⠀⢀⣴⠟⠉⠀⠀⠀⠈⠻⣦⡀⠀⠀⠀⣤⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢸⣿⣿⣷⣀⢀⣾⠿⠻⢶⣄⠀⠀⣠⣶⡿⠶⣄⣠⣾⣿⠗⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠉⠉⢻⣿⣿⡿⣿⠿⣿⡿⢼⣿⣿⡿⣿⣎⡟⠉⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣼⡟⠉⠛⢛⣛⡉⠀⠀⠙⠛⠻⠛⠑⣷⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢠⣿⣧⣤⣴⠿⠿⣷⣤⡤⠴⠖⠳⣄⣀⣹⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⣿⣀⣟⠻⢦⣀⡀⠀⠀⠀⠀⣀⡈⠻⣿⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⣼⡿⠉⡇⠀⠀⠛⠛⠛⠋⠉⠉⠀⠀⠀⠹⢧⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⣾⡟⠀⢦⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠃⠀⠈⠑⠪⠷⠤⣀⠀⠀⠀⠀⠀⠀⠀⠀⠀ ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⣠⣾⣿⣿⣿⣦⣼⠛⢦⣤⣄⡀⠀⠀⠀⠀⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠉⠑⠢⡀⠀⠀⠀⠀⠀ ⠀⠀⠀⠀⠀⠀⠀⢀⣠⠴⠲⠖⠛⠻⣿⡿⠛⠉⠉⠻⠷⣦⣽⠿⠿⠒⠚⠋⠉⠁⡞⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠘⢦⠀⠀⠀⠀ ⠀⠀⠀⠀⠀⢀⣾⠛⠁⠀⠀⠀⠀⠀⠉⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠤⠒⠉⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⢣⠀⠀⠀ ⠀⠀⠀⠀⣰⡿⠃⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣑⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⡇⠀⠀ ⠀⠀⠀⣰⣿⣁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣷⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣾⣧⣄⠀⠀⠀⠀⠀⠀⢳⡀⠀ ⠀⠀⠀⣿⡾⢿⣀⢀⣀⣦⣾⠃⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣾⣀⠀⠀⠀⠀⠀⠀⠀⠀⠀⡰⣫⣿⡿⠟⠻⠶⠀⠀⠀⠀⠀⢳⠀ ⠀⠀⢀⣿⣧⡾⣿⣿⣿⣿⣿⡷⣶⣤⡀⠀⠀⠀⠀⠀⠀⠀⢀⡴⢿⣿⣧⠀⡀⠀⢀⣀⣀⢒⣤⣶⣿⣿⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⡇ ⠀⠀⡾⠁⠙⣿⡈⠉⠙⣿⣿⣷⣬⡛⢿⣶⣶⣴⣶⣶⣶⣤⣤⠤⠾⣿⣿⣿⡿⠿⣿⠿⢿⣿⣿⣿⣿⣧⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⡇ ⠀⣸⠃⠀⠀⢸⠃⠀⠀⢸⣿⣿⣿⣿⣿⣿⣷⣾⣿⣿⠟⡉⠀⠀⠀⠈⠙⠛⠻⢿⣿⣿⣿⣿⣿⣿⣿⣿⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⡇ ⠀⣿⠀⠀⢀⡏⠀⠀⠀⢸⣿⣿⣿⣿⣿⣿⣿⠿⠿⠛⠛⠉⠁⠀⠀⠀⠀⠀⠉⠠⠿⠟⠻⠟⠋⠉⢿⣿⣦⡀⢰⡀⠀⠀⠀⠀⠀⠀⠁ ⢀⣿⡆⢀⡾⠀⠀⠀⠀⣾⠏⢿⣿⣿⣿⣯⣙⢷⡄⠀⠀⠀⠀⠀⢸⡄⠀⠀⠀⠀⠀⠀⠀⠀⢀⣤⣿⣻⢿⣷⣀⣷⣄⠀⠀⠀⠀⢸⠀ ⢸⠃⠠⣼⠃⠀⠀⣠⣾⡟⠀⠈⢿⣿⡿⠿⣿⣿⡿⠿⠿⠿⠷⣄⠈⠿⠛⠻⠶⢶⣄⣀⣀⡠⠈⢛⡿⠃⠈⢿⣿⣿⡿⠀⠀⠀⠀⠀⡀ ⠟⠀⠀⢻⣶⣶⣾⣿⡟⠁⠀⠀⢸⣿⢅⠀⠈⣿⡇⠀⠀⠀⠀⠀⣷⠂⠀⠀⠀⠀⠐⠋⠉⠉⠀⢸⠁⠀⠀⠀⢻⣿⠛⠀⠀⠀⠀⢀⠇ ⠀⠀⠀⠀⠹⣿⣿⠋⠀⠀⠀⠀⢸⣧⠀⠰⡀⢸⣷⣤⣤⡄⠀⠀⣿⡀⠀⠀⠀⠀⠀⠀⠀⠀⢀⡆⠀⠀⠀⠀⡾⠀⠀⠀⠀⠀⠀⢼⡇ ⠀⠀⠀⠀⠀⠙⢻⠄⠀⠀⠀⠀⣿⠉⠀⠀⠈⠓⢯⡉⠉⠉⢱⣶⠏⠙⠛⠚⠁⠀⠀⠀⠀⠀⣼⠇⠀⠀⠀⢀⡇⠀⠀⠀⠀⠀⠀⠀⡇ ⠀⠀⠀⠀⠀⠀⠻⠄⠀⠀⠀⢀⣿⠀⢠⡄⠀⠀⠀⣁⠁⡀⠀⢠⠀⠀⠀⠀⠀⠀⠀⠀⢀⣐⡟⠀⠀⠀⠀⢸⡇⠀⠀⠀⠀⠀⠀⢠⡇

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

letsss goooo div3

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

Why everyone disrespects him, everyone made mistakes before. Just enjoy round!

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

    Because he has made more than one mistakes.

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

    Because he made mistakes more than others

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

Div.3 begin, 74TrAkToR's back, enjoy the trip.

:)

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

OMG! Another 74TrAkToR Round ..

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

let's go! Hope everyone has fun.

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

I feel this blog will be the most downvoted blog in codeforces history.

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

74TrAkToR has to increase his contribution. Good luck !!!

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

Looking at your contribution value, I don't want this round.

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

Sorry Guys

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

Competition will return

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

rated div-3 after 255 days)

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

I hope you have a wonderful round

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

I believe 74TrAkToR will bring us a wonderful Div3 this time.

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

As a tester, I tested :)

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

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

    What's up with div1 + div2? I can't help, but notice that for some reason low-rated users participate in these contests less eagerly than in div3/div4/even div2

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

      As a CM, I can say that there is a notable difference in difficulty and performance between div2 and div 1+2. This would further exasperated if I could do rated Div3 and Div 4 like pupil/newbie. They just want to do the easier problemsets.

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

int count = div_3_every_month;

if(count>=3) { cout<<" Helpful for Newbies , Pupils and specialist "<<endl; } else { cout<<"As it is now"<<endl; }

what do you think?

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

Good Bye 2023!!

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

Hope to enter in blue......

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

This is going to be the one for the books

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

I think 74TrAkToR is one of the geniuses He is very good at writing problems and is very popular on this site

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

It sounds a little interesting！I will try my best to enjoy the round！

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

Have the ratings of previous rounds been re-judged? I don't know how my rating got decreased by 18 suddenly.

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

Hope to solve A

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

    no matter the condition I actually enjoy when A is very tricky even if I'm not able to solve it

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

are there any hacking points for this contest?

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

    No, there are no points for hacking in contests with open hacks phase (usually educational, div 3, and div 4) as someone might create multiple accounts to hack themselves and gain points for this, but if you find a test case that can be used to hack a lot of solutions you can get a better place in the standings by hacking people above you.

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

Finally I can write this.

as a tester, I can confirm that this contest will be a div 3

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

on the edge of being specialist

trust in 74TrAkToR round

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

hope to reach candidate master

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

I think we should let the bullets fly for a while, at least until we see the problems of this one :D

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

Hoping by this contest I leave newbie status

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

My cf id is not opening and handle is kxhitz. I had given last contest on 16th June 2024. Please check it out. Solve this issue as soon as possible so that i can continue my practice and participate in contests.

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

    Looks like it has been banned after the recent rollback, if you can prove that the solutions were your original ones and not cheated with anyone, then you can message the Coordinator of the last round to remove the ban otherwise it is gone forever.

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

      thanx for reply. I have messaged the coordinator of that round. Sir, how much time this would take as I have never copied anyone's code in any contest I had given till now.

      Is there anything else I should do ??

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

        Quit cf, you cheated in 6 almost consecutive rounds

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

          But Sir I haven't received any warning mail and also didn't received any accusation message to my account regarding any case of cheating by me, Even Sir I didn't attempted cheating. Sir I have also contacted the coordinator of the last contest to solve my problem. Please suggest me what should I do for it.

          → Reply
»
6 months ago, # |
  Vote: I like it +125 Vote: I do not like it
this round is brought to you by...
→ Reply
»
6 months ago, # |
  Vote: I like it +2 Vote: I do not like it

as div3 enjoyer, i hope it will be a great round!

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

Dreaming to achieve contribution as 74TrAkToR

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

With such a low rating from this questioner, I have reason to believe that this game is bad, and I believe there are a lot of people who have stepped on it, because I've seen a lot of honest people get downped, which is kind of ridiculous

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

Who's going to try to OEIS G tomorrow?

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

Tracktor has become celebrity of codeforces

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

damn i thought 74 is all history

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

Hope pref 2000+ Although 74 round

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

Excited for Round 954! Big thanks to 74TrAkToR and the whole team for their hard work and dedication in organizing these rounds. Good luck to everyone!

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

i have high respect for low contribution authors

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

Best of luck everyone!

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

Hope today is not speedforces.

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

Upvote me- Div 3 A to Div 3 D easy and Div 3 E and F medium and Div 3 G Hard

Downvote me- Div 3 A easy and Div 3 B to G Super Super Hard because of 74TrAkToR

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

Delayforces...

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

Bro it's delayed!

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

what should we do in delayed time?

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

74TrAkToR is late...

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

Delayed cause everyone's watching F1

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

Delayed

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

delayed :)

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

This is a delay in second 74TrAkToR's contest in a row

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

Delayforces :(

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

Is there ever going to be a div 3 round without delay?

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

The TrAkToR is going slowly so we have a delay.

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

thanks I just finished a heavy plate of pasta and I needed that 15 minutes

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

Everyone will try to become a pupil or specialist. I will try to submit before the cheaters

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

    Problem A Solution

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

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

Please, don't worry about delay, Mike asked for it to increase testing speed a little.

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

I think its delayed because Codeforces is having issues

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

I hope it's a nice round, Good luck to every one! :)

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

Traktor king lets go

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

What happened? why so much people know about the writer?

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

I thought that I missed the round start by one minute. But, it turned out that I have to wait for more than 10 minutes for the round start now!

Good luck to all, compete fairly and enjoy competitive computer programming.

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

Hope Goodbye 2024 will be super hard for B and above problems and only A is very easy if 74TraKtor Coordinates again.

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

still loading ,uhhh?

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

good round, solved A,B,C

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

I don't understand the author's intention to split $$$G$$$ into two tasks and not able to think of a specific algorithm to solve $$$G_1$$$.

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

    Lol, many people submitted G1 but not G2. Or submitted G2 much later.

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

      I believe both $$$O(n*sqrt(n))$$$ or $$$O(nlog(n))$$$, anyway $$$O(n*log^2(n))$$$ could pass. Can anyone share the algo of $$$G_1$$$

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

not-balanced round

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

Does D use meet-in-the-middle to solve? It seemed so easy but I couldn't solve it...

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

    its just some case handling but there is an edge case that I couldn't find out yet

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

    it's just brute force on brute force

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

    first solve the following question: given an array of numbers, what is the minimum value of their expression?

    this is easy enough: multiply ones and zeroes, sum everything else.

    after solving this problem all you have to do is try it for all possible lists of numbers. notice that there are only $$$n - 1$$$ such lists

    the final complexity is $$$O(n^2)$$$

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

      I was thinking that approach, but it seems there are lots of cases to handle. For example, assume the digit is "abc0def". How do you decide whether to multiply c x 0, bc x 0, 0 x d, 0 x de, ..? We need exactly N-2 symbol. Probably 0xde leads to the most optimal one instead of 0xd.

      At the end I use DP.

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

        in this case you multiply everything by the zero, for example:

        $$$ab * c * 0 * d * e * f$$$

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

    Handle the edge case where result is 0. Which is pretty simple.

    Since you always have (n-2) signs, therefore theres always a 2 digit number(including 01-09) present in your calculation.

    The problem reduces to finding this 2 digit number then applying the following algorithm:

    Let i be the starting position of the 2 digit number. For each character from 0..i-1 and i+2..n, add if digit is not 1 otherwise multiply it and finally add the 2 digit number.

    Now to find that 2 digit number: You can iterate through all possible 2 digit numbers and add them to vector and sort it.

    Then among lowest 2 digit numbers that have the same digit in 1's place, pick the one that gives you the lowest result.

    You need to do this because sometimes picking the minimal number is not optimal, like 22 gives better result than 21 in one of the test cases.

    I couldn't come up with a better method to pick the minimum number so I kinda brute forced it. The time complexity is O(nlogn). (Picking optimal 2 digit number through sorting)

    Sorry if my description is kinda convoluted I am still learning

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

    Actually, you can brute force the element that will be combined with the right one and then try this: When there is 1 you multiply it, otherwise you sum it and write corner cases with zero, because you can multiply everything and make ans 0, but not in 101 and etc.

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

Solved 4 problems, I'm very happy and satisfied :D

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

Really nice problems!

I found a bug in my bridges code due to problem F, thanks to problem authors!

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

You must think you're humorous by choosing these questions. :D

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

bye bye rating 💩

problem b were bit hard for it's position (second div3 problem), waste 30min to implement without ChagGPT, rating completely ruined

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

Thanks for the amazing contest 74TrAkToR !!! Finally a Div 3 contest that felt like a proper, balanced Div 3 contest <3

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

    if you solve 5 tasks first time it doesn't mean that contest is balanced (((

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

      Ofc not, it might mean that the contest was easier than usual because I was able to solve more problems. But I did feel like this was a proper Div 3 for those whom it was meant for — people rated below 1600. The tasks weren't too random (like traktor's previous contest) and almost 1.5k to 2k people below 1600 rating solved till E in the contest, so I think it is fair to judge it was balanced. Not too much DSA, not too much math, etc.

      Also, this was meant as an appreciation comment for traktor for organizing this good contest after what has happened in the past.

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

Shit man!, wasted almost an hour because of overflow in D, could have done some more if that didn't happen, Only me to blame! thanks for the round..

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

What was intended for G2? I used (almost) the same $$$O(n\sqrt{n}\log(n))$$$ code for G2 as G1 which doesn't seem like it should pass G2.

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

    I solved it in $$$O(nlogn + n*maxdivs(A))$$$ which $$$maxdivs(A)$$$ about $$$300$$$ i guess. The problem becomes for 2 simplified fractions, count the number of pairs of fractions $$$(x1/y1), (x2/y2)$$$ multiplied together to produce an integer. When fixing the denominator of the first fraction ($$$y1$$$) => the numerator of the second fraction must be divisible by the fixed denominator ($$$x2$$$ divisible by $$$y1$$$). => count the number of fractions with numerators $$$x2$$$ and $$$x1$$$ divisible by $$$y2$$$. Just brute all $$$y2$$$, processing $$$x1$$$ can be done before.

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

D and E are too much implementation heavy...

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

    what is the correct idea of E? I thought of try pairing every two elements from A so every element we can write it as follow : a[i]=x*k + a[j] for j != i

    but I didn't implement it

    is it correct?

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

      .

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

      Let $$$x + kn = y$$$ ($$$n$$$ operations on $$$x$$$). This implies $$$y - x = kn$$$. This difference is divisible by $$$k$$$. Thus, two elements can only be made equal if they give the same remainder when divided by $$$k$$$ (if they don't, their difference is not a multiple of $$$k$$$).

      So we group elements with the same remainder modulo $$$k$$$.

      If there are $$$\geq 2$$$ groups with odd number of elements, it is impossible to construct a palindromic array.

      So, we move on to the case where you can apply operations.

      For each group, let its sorted list of elements be $$$a_1, a_2, \cdots, a_n$$$.

      For an even-sized group, $$$(\lvert a_2 - a_1 \rvert + \lvert a_4 - a_3 \rvert + \cdots + \lvert a_n - a_{n-1} \rvert )/k$$$ is the minimum score needed for that group.

      For an odd-sized group it's similar but a little bit more complicated. You will pair $$$2k_1$$$ elements in the front and add their score using the even group method. Then, an element will be left out to be the middle element of the palindrome. After that, the score for the remaining $$$2k_2$$$ elements will be added. The optimal left out element can be calculated using prefix sums.

      So you have the total score for each group, and you sum it over all the groups to get the final answer

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

        How can the optimal left-out element be calculated using prefix sums? What's the implementation idea

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

First time get MLE in div3 round

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

I knew I shouldn't have given this round. Guess people never change.

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

For E, I wasted a lot of time on prefix/suffix sums to find the optimal element in the odd length array to put in the middle. Then, I realized I could use DP to do it without much thinking.

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

    same bro realised it later and wasted a lot of time on prefix sums, also I did another blunder, by asking this from gpt-4 and claude 3.5 sonnet. they weren't able to code correctly this simple task of prefix sum.

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

    you could also do it using prefix and suffix sum. see

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

    Lol me too,but int the end i just ended up doing it with single variable :) or ig :(

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

    Interesting. I found Greedy with prefix sum easier.

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

    How does the DP work in detail? I don't really understand the transitional relationship.

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

    Nice approach . I was not able to think about this and solves using prefix and suffix sum of two pairs. It was very heavy implementation for me

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

    Why do we even need DP? Can't we just solve it in O(1) memory? (267066755)

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

    (recent) parameter in your dp function is not necessary.

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

    No need of 3d DP, recent state can be avoided, 2d is also accepted

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

remind me to never give a traktor round again!

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

solved F 3 minutes after contest finished...... :(

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

I would die rather than to attempts traktors mathy and implementation heavy rounds

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

implementation forces!

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

L round

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

wrote recursive function to verify my observations in D and I found out that I can memoise my recursion function and convert it into dp.

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

Skipping traktor's rounds from now on.

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

who let him cook a template bridge problem???

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

    lol

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

    For this kind of a standard problem there are not that many solves tho

    Although it does scream bridges the moment you look at it

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

    what is template bridge problem? easy to solve with concept from classical/standard problem?

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

      Take a look at this

      Additionally in today's problem you also have to come up with a way to calculate sizes of components after you remove a bridge (which is not too difficult)

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

    I copied the bridge search algorithm from an Internet site (the algorithm was published long before the start of the round) without rewriting it by hand and made some changes. I read the competition rules on the codeforces platform and still didn't understand if I could do this. I hope this question will be clarified to me.

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

    I pasted the statement into GPT4 and it gave a slow python DFS solution, then with one prompt I managed to get it to provide a correct solution (only had to fix an overflow bug).

    use c++, and do it in O(n) by storing subtree sizes and a bridge finding method was the prompt that allowed it to solve the problem!

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

I thought what could possibly change by just increasing the constraint by a mere 5 times in problem G, but it effectively thwarted my square root decomposition solution from G1, and I ended up having many MLE/TLEs :( .

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

div 2.74 (74 from 74TrAkToR)

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

why carrot giving error?

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

nice

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

good round, thanks for the problems.

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

It is so hard ! How can I improve myself quickly ? I vp many recent contests and make the topic I missed after the contest.

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

Task F can be said to be a learning task for finding bridges in a graph. I copied the bridge search algorithm from an Internet site (the algorithm was published long before the start of the round) without rewriting it by hand and made some changes. I read the competition rules on the codeforces platform and still didn't understand if I could do this. I hope this question will be clarified to me.

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

I'm not able to guess the complexity for my solution of G2, someone hack it. 267078205

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

Decent round tbh. Better than previous round by 74TrAkToR. Skill issued on implementing, but so did everyone else, I guess.

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

I was worried for this round (delay + goodbye 2023 trauma), but hopefully it was good, Good job 74TrAkToR

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

Here is my DP solution for D.

267043778

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

You can check my video editorials of D, E and F if you have any doubts

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

How to hack B?

can anyone hack my solution?

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

Silly mistake cost me E :(

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

267089006 testcase where it fails ?? someone

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

Okay I'm fairly new to Codeforces, so I have no idea what hacking is. I had successfully solved A and B. But now sometime later after the round has ended, I open up the round page, B is highlighted in red, and after checking submissions I see that the verdict for B has changed to "Hacked"..... what.... why.......

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

    It means that your submitted solution isn't fully correct

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

      How not correct, like to what extent?

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

        It means that someone has found a testcase in which your solution is giving wrong answer. So he basically hacked your code....

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

          .....wow okay

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

            In this particular case your solution can't fit in given time constraints, so it fails. You need to find a more optimized one.

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

I have a new version of c can anyone help me in that.
Update in 1986C - Update Queries, what if t was not allowed to sort the string c then how will approach. any suggestions.

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

    Here's what i thought about this:

    First lets store the distinct occurences of indices in increasing order along with its count. Now for an index $$$i$$$ in this array, we will try to place the smallest available character in $$$ith$$$ pos of $$$s$$$. The position of the chosen character in string $$$c$$$ should be such that we can place all other occurences of $$$i$$$ before it (since it only matter what we place last for an index $$$i$$$). For each character the best chance to be able to choose it would be if we choose the last available occurence of that character.

    So now what remains is how do we choose which characters would correspond to the leftover occurences ? It would be best to strike off the maximum characters to the left of the last occurance of the chosen character. We can simulate that using a segment tree.

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

      I was thinking of the same approach but the main difficulty I faced was like suppose for index 1 we have count of 4 and for index 2 we have count of 3.
      So, we have sorted t array something like this: 1 1 1 1 2 2 2 .........
      Now have to assign best character to last 1 such that there are at least 3 characters before it so that we can assign them to preceding 1. Now for 2 we need to remove max 3 characters that were assigned to 1 and the smallest characters then again go with 2.
      Can you tell how you will tackle this, if possible, provide the pseudo code and expected Time complexity.

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

        For each character we will store a set of its occurances in string c. Now suppose we want to assign the last index of 1 a character, we begin by checking if it is possible to assign a, b, c.. z . Checking if its possible simply implies if there are enough positions to the left of the last occurance of a char. For this we will use a segment tree to find range sum of available positions. Now once we find a valid index, we will start assigning the rest of the occurances of 1 characters. Suppose the valid index was $$$i$$$. Now we need to assign all previous occurances of 1 to some available characters that werent already assigned from $$$[1,i-1]$$$, and it is best to assign the max characters which are available one by one. To find out a max character we will query the max in range $$$[1,i-1]$$$ which will return the index of the max available character in $$$c$$$ in that range. Now we set this value as 0 since we already used it and remove it from the set of occurances of that character and proceed further.

        So for each index we will be querying once,updating the segment tree once, updating occurance set and checking all characters validity worst case. So expected TC should be $$$O(26n + nlogn)$$$.

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

I don't know why some people complains so much about this Round, it doesn't matter if it's all implementation or math, after all is a problem u need to solve, there are no excuses in real life problems, good Round admins!

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

Could anyone please explain how to solve D? I understood that the main task is to find the two digit number, and then multiply a number if it is 1, otherwise add it. But I just cannot figure out how to implement that.

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

    Here is my submission https://mirror.codeforces.com/contest/1986/submission/267070013 What I did was I first handle the cases when there is a 0. I then generate all possible combinations of two digit numbers, and for each combination calculate the answer, and then took the minimum of all the answers. Calculating the answer is a separate function, I did it recursively:

    1. If the current element is $$$1$$$, we skip it.
    2. Otherwise, we add the current element and we move to the next element.(In the code I also handle the case if the next element is $$$1$$$, which is unnecessary)
    → Reply
»
6 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Contest was great,but cloudfare spoil it for me

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

D was such a pain, I missed one simple if for a super basic case I thought I added, but realised I forgot a little after the contest whilst laying in bed sad after not solving D.

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

Any reason we are using memory limit 128M instead of the default 256M for G?

I didn't see any reasons to reject solutions on the memory constant factor.

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

MLEFORCES

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

Can anyone explain why unordered_map solution is giving TLE, while map is working fine?

unordered map

map

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

    You should read this: https://mirror.codeforces.com/blog/entry/62393

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

      It is interesting that the post was made 6 years ago, yet lots of people (me including) dont know. Shouldnt they patch and prevent people using bugged version? Even though perfect implementation is crucial in CP, one shouldnt penalized due to buga from the compiler.

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

        This isn't a bug of the library or the compiler. C++ specification clearly states that unordered_map<K,V>::insert()'s time complexity is worst case O(N) (cppreference).

        If you are curious about how this happens, study the data structure of hash tables.

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

can someone explain why this fail for problem B https://mirror.codeforces.com/contest/1986/submission/267043411

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

    Your code fails if n=1 or m=1: 

    if(i==0){
    if(j==0) {
	if(mat[i][j] > max(mat[i][j+1], mat[i+1][j]))							 
               mat[i][j] =max(mat[i][j+1], mat[i+1][j]);
	}

    You look at positions (i,j+1) and (i+1,j) without checking if they exist. I don't recomend to write so many if-statements, because then it's very easy to make small mistakes like this. Example of my code without so many if-statements: 266984242.

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

i am kinda new to codeforces , how is ranking decided ?? does it depend on number of problems solved ?? (or) do each problem has different weightage ?? like problem D. has more weightage than problem C . if anyone knows this please enlighten me :) .

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

    If a point distribution is mentioned in the announcement blog, the problems will carry weight accordingly. If no distribution is mentioned, then the problems have no specific weightage. Generally, Div3 and Div4 contests do not have specific problem weightage, while most Div2 contests do.

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

Surprised Pikachu

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

    Turns out test 43 is the first test where $$$n = 500000$$$, which is odd.

    Stress tests should be among the initial tests. Otherwise, it takes too long to get the verdict during a contest.

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

Can someone please explain that in E — Beautiful Array, for the input

13 3 2 3 9 14 17 10 22 20 18 30 1 4 28

How is the output 14? I re -checked multiple times and found it to be 15.

Please reply ASAP

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

    for your remainder equal to 1 the sequence is {1,4,10,22,28} in this you should remove 10 and pair 1 with 4 and 22 with 28.

    sorry for bad English.

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

Does anyone feel E was of rating 1400+?

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

Is there going to be a system testing after hacking?

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

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

Can someone explain why this solution failed as TLE?267007171 .I expected the Time complexity as O(nlogn+mlogm).

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

    I'm pretty sure that you are making it O(n^2) through string concatenation (basically, appending a char to a string of length n has time complexity of O(n) because strings in python are fixed-sized unlike C++ where they are almost a glorified vector)

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

      Thanks for your reply and pointing out the mistake, i think it would be a lot helpful to me in the future. Really appreciate it But still i got a question — why does this same code passes with Python3- 267178416 whereas the same code gets a TLE with PyPy3- 267007171

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

        I am not Python expert, I mostly do C++ and some Rust but my guess is that Python3 interpreter recognizes that you are building a string char by char and does some clever optimization on this code which allows it to avoid the O(n^2) pitfall somehow

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

I have sacrificed 'D' to score 'E'! It was a little heavy implementation (E).

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

unrated

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

    what?

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

    who announced??

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

    Unlikely, It's just that tests took quite a lot of time because there were a lot of hacks and that's the reason the whole thing kinda got shifted to later

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

unrated???

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

Is the round going to be unrated??? The ratings aren't updated after system testing

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

unrated :(

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

why unrated

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

    unrated for me too

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

      Until a contest is rated it will be displayed as unrated. Sometimes it can take more than 24hours to roll out ratings and sometimes they rerate contests too. Nothing to worry ratings will be out maximum by tomorrow. (P.S Don't mind if there are any spelling or grammatical errors)

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

        yes..it's been updated for me

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

Changing map to a sorted vector of elements + binary search works in G2, the time complexity is the same but i can't figure out why it removes the MLE i get with map, since intuitively, i am storing count in map and elements in vector, the storage in map is more sparse, is this happening because in testcase 43 the array values are such that, it leads to lower count values in map and thus, reducing the advantage of sparseness?

Map submission

Vector submission

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

So why does this code: link return a result of Runtime error? I was able to compile the sample locally.

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

I had given this contest on time using my laptop. This post is to show that there was no violation. Kindly look into it @codeforces The 1st ques was the X Axis in which the soln was that to find the median and find distance of rest 2 points from the median. The median would be the center point after sorting the array

The 2nd ques was Matrix Stabilization. I had created a priority queue and inserted all the cells into it. then changed the value to the maximum around it if it was greater and again pushed in pq else skipped

The 3rd ques Update Queries. In this ques, I created a set for the indices array and sorted it. also sorted the string c and mapped each ele to each index. and finally applied the transformation on s and found the ans.

The 4th ques was Mathematical Problem. If zero is first or last ele-> ans is 0. if len ==2 , ans is the number. Now, if len > 3 and zero is found, ans is 0. If len == 3 and zero is found in middle, return max of a+c and a*c. If 0 is not there is the string. I have to take pair of each 2 ele and combine and check for the mini. If 1 is found, skip it

The 5th ques was Beautiful Array. I used a map to track remainders % k and their corresponding values, ensuring each remainder set has even size by inserting and removing elements. Finally, I calculated the minimum operations needed to make the array satisfy the required conditions and return the result

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

Dear Codeforces Team,

I have received a notice about my solution (ID: 267058250) for problem 1986D coinciding with other solutions. I would like to clarify that any similarity is unintentional. Here are the details:

  1. I used Chatgpt Open AI which is publicly available to just correct the error of type casting in my code.

I have always aimed to compete fairly and adhere to the rules. I hope this clarifies any misunderstandings. Please let me know if further information is required.

Thank you, Mr.Mittal

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

Respected Admin/System,

This is HeroicMage. This is with regards to the message for my submission Your text to link here... being similar to Your text to link here....

I am extremely sorry for this. I won't tell that I don't know the other person. In fact, he is a good friend of mine. But I haven't copied from him or from any other participant on the website. I just used the concept of prefix sums and suffix sums to exclude one element to find out the maximum among all possible contributions to answer if the size of numbers with same remainder is odd.

I could see the similarity in the use of data structures and the concept of prefix and suffix sums in both the submissions. But the data structure similarity could be also for people who might have used map <int,vector> or unordered_map instead of map<int,multiset>. But I can tell with utmost honesty and sincerity that I haven't copied from anybody else. It is my own solution and my own idea.

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

Hello sir i just wanted to say that i haven't leaked any solution the claim that is being made on me is wrong. ashok_0/267077276 he has copied my solution i dont know how my solution got leak. I was giving contest in cafe where all others are also doing the contest. Might possible that he has cheated or all the pcs are connected with the main server so he has access to the main server. Sir my all solutions are in cpp and also my templates are same.His solution is in java and he has copied my solution. Please help me Sir I haven't done wrong.

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

I just received a message about plagiarism. The people who I can see have plagiarised with me are all my hostel mates. I don't know how they got hold of my code, but I have definitely not shared it with literally anyone.

You can see that I am the 1st person to submit E in the way I have written it, ensuring it is unique and not plagiarised. I would request you to penalize all similar submissions after mine as mine wasn't plagiarized theirs was through no fault of my own. I HAVE SOLVED ALL THE QUESTIONS ON MY OWN AND THIS IS THE BEST CONTEST I HAVE HAD TILL NOW, SO PLEASE PLEASE PLEASE DONT ROLL BACK THE RATING

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

    This is the 1st time such a thing is happening with me and I will ensure this never happens again, please don't penalize this round

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

..

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

Respected Codeforces team,

I had received a message saying that my solution for F, E and D coincides with other people's solutions (around 200 to 500 people), I would like to clarify that my code for D and E were written by me (E's logic was easy it was looking for numbers with same remainders and grouping them, the case of having one remainder having an odd set of numbers took some implementation but I got the logic early cause I had solved some similar grouping problem earlier, though for earlier versions of D ChatGPT AI was used for writing the calculating minimum value function (helper) the final version which got excepted was written entirely by me), for F, I used chatGPT AI (which is publically available) to generate a function for finding the bridges in a graph and computing subtree sizes. Please check my solutions and look into it.

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

.

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

I am writing to express my concern regarding the recent cancellation of my contest submission due to the coincidental similarity of one of my four codes with another participant's code. While I understand the importance of maintaining the integrity of the contest, I would like to clarify that this similarity was purely coincidental and not a result of any form of misconduct.

It is not uncommon for similar solutions to arise independently, especially when addressing common problems or using standard approaches. I assure you that all my submissions were created independently and with the utmost integrity.

I have submitted all the code by writing them manually on VS code first then submitting it. I don't use libraries or any other stuff that must be one of the reason which might have gotten my code to be similar to others, but in honor regards I want u to consider if my only 1 out of 4 code is found similar but I made Problem D which is much harder than C myself. Which clearly shows that I have enough potential to solve C too on my own.

I kindly request a reconsideration of my disqualification, taking into account the originality and uniqueness of my other three codes. I am more than willing to provide any additional information or clarification needed to resolve this matter fairly.

Thank you for your attention to this issue. I look forward to a fair resolution.

Sincerely

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

i'm kinda new to contests in codeforces so i dont know if this was a hard contest or the other div 3 contests where too easy. i normally solve around 2 or 3 problems in div 3 contests but i could only solve problem A in this one.is that just a me problem ?

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

in the second paragraph of problem D, what does two symbols cannot be written consecutively?

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

Was there some changes in the rating updation?

I had gotten +39 now I have +51 in this contest.

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

Recently I am being accused of plag cases by many people and this is actually hurting me a lot. You can check out my linkedin GeeteshPaidi and confirm that i am a python developer and C++ is actually my new language, that one time due to time pressure i have written my code in python because i could lose my rank. For that one qn i am being accused as a cheater. So i decided I am talented enough to rise to this rank again instead of taking these claims. Thank you codeforces for teaching me another life lesson. See you again on the top board with only C++. Signing off as geeteshpaidi. This account will no longer be active!

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

jiangly Can you please explain your solution for G1 and G2?

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

Good contest

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

.

→ Reply