who is your contribution dude

OMG 74TrAkToR!!!!

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

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

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

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

OMG Bro 74TrAkToR!!! :Skull

letsss goooo div3

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

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

:)

OMG! Another 74TrAkToR Round ..

let's go! Hope everyone has fun.

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

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

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

Sorry Guys

Competition will return

rated div-3 after 255 days)

I hope you have a wonderful round

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

As a tester, I tested :)

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?

Good Bye 2023!!

Hope to enter in blue......

This is going to be the one for the books

Oh no, Oh no no no no, 74TrAkToR is the author, shut the doors and windows, a crisis is about to begin

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

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

OMG T74TrAkToR round this will be amazing ...

I don't get it. why some people hates him.

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

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

Hope to solve A

are there any hacking points for this contest?

Finally I can write this.

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

on the edge of being specialist

trust in 74TrAkToR round

hope to reach candidate master

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

Hoping by this contest I leave newbie status

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.

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

Dreaming to achieve contribution as 74TrAkToR

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

Good luck everyone !

Who's going to try to OEIS G tomorrow?

Tracktor has become celebrity of codeforces

free tibet!!

Good luck everyone!

damn i thought 74 is all history

Hope pref 2000+ Although 74 round

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!

i have high respect for low contribution authors

Best of luck everyone!

Hope today is not speedforces.

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

delayforce

Delayforces...

contest got postponed for 15min

deley

Bro it's delayed!

delay :(

what should we do in delayed time?

74TrAkToR is late...

Delayed cause everyone's watching F1

Delayed

delayed :)

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

Delayforces :(

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

The TrAkToR is going slowly so we have a delay.

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

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

I think its delayed because Codeforces is having issues...

the time has been changed?

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

I think its delayed because Codeforces is having issues

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

Does the delays coincidentally happen in 74TrAkToR's round.

Traktor king lets go

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

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.

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

still loading ,uhhh?

good round, solved A,B,C

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$$$.

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

not-balanced round

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

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

Really nice problems!

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

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

bye bye rating 💩

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

I loved G, cool round! (maybe F was a bit too obvious tho)

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

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..

G2 43no case: what is the case that getting mle

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.

D and E are too much implementation heavy...

First time get MLE in div3 round

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

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.

int dp[200001][2][2] = {};
int dfs(vector<int>& v, int pos, bool can, bool recent, int k) {
    if(pos>=v.size()) return 0;
    if (dp[pos][can][recent] != -1) return dp[pos][can][recent];
    int ans = INT_MAX;
    if(pos+1<v.size()) ans = dfs(v, pos+2, can, false, k)+ (v[pos+1]/k-v[pos]/k);
    if(can) ans = min(ans, dfs(v, pos+1, false, true, k));
    return dp[pos][can][recent] = ans;
}

void solve(){
    int n, k;
    cin >> n >> k;
    vector<int> v(n, 0);
    for (int i = 0; i < n; i++) cin >> v[i];
    map<int, vector<int>> mp;
    for (int i = 0; i < n; i++) {
        mp[v[i]%k].push_back(v[i]);
    }
    int odd = 0;
    for (auto& i : mp) {
        if(i.second.size()%2) odd++;
        sort(i.second.begin(),i.second.end());
    } 
    if(odd>1) {
        cout << -1 << endl;
        return;
    }
    int ans = 0;
    for (auto & i : mp) {
        if (i.second.size()%2 == 0) {
            for (int j = 1; j < i.second.size(); j+=2) {
                ans += (i.second[j]/k-i.second[j-1]/k);
            }
        }
        else {
            for (int a = 0; a < n; a++) for (int b = 0; b < 2; b++) for (int c = 0; c < 2; c++) dp[a][b][c] = -1;
            ans += dfs(i.second, 0, true, false, k);
        }
    }
    cout << ans << endl;
}