The order of the team "P+P+P" must be changed to get mod 998244353

I plan to do so.

Pupil is nothing to flex about imo :)

I am just here to apologies to all

I am a newbie and wanted to excel in the CP as fast as possible due to which I choose this path, but the last contest had made realize that this is the wrong way I am doing it I must not do this like this so I just decided to restart it and now I learned from my mistakes and never do plagiarism again that is my promise

Auto comment: topic has been updated by atcoder_official (previous revision, new revision, compare).

If this ABC as shit as the last ABC, I will ban you.

I look forward to qwef_ achieving good results! (what)

Kazakhstan also XD 998batrr

Your interviewer won't give a shit even if you're pupil.

Siddarth_MSR orz!

E_fireworks can't AK because he is one of the authors :(

(-1/12) (mod 998244853) = 415935147 (mod 998244853), here yo go!

change password)

Might be a doppelganger.

The venue is 2 hour driving from me XD

well, i also thought in that way so after third decrease i changed it today i hope it works ))

Can you please predict how much more contest I need to participate to reach LGM, given that I will attend each available contest which start at least 1 hour before usual time?

If the answer is I can't reach LGM after all, output -1. Otherwise, print the answer modulo 998244353.

Disagree, literally the whole point of edu rounds is to introduce standard concepts to more programmers...

you basically want all possible combination of 2*b = a+c , so in other words if you are able to compute all possible values of a+c in the array, you will be able to check for each a+c , how many 2*b exist, and to calculate all possible a+c , you will need FFT, you will keep all the values in the array as powers , and then multiply the polynomial with itself, thus getting all possible combinations of a+c as the powers of the new polynomial, this way you will be able to calculate the number of b which satisfy the given constraint. It's a really nice question. I also wasn't able to solve it during contest unfortunately :(

Will the GOAT of IIT Hyderabad participate in this contest? Can't wait to be humiliated by him again

What type is i? Is it signed or unsigned? If it is unsigned, then I 100% agree with AksLolCoding. If it is signed, then I still agree with AksLolCoding 99%, but even the wrapping behavior is no longer guaranteed. Signed integer overflow is Undefined Behavior in C++. Depending on your exact compiler version and options, very different things can occur (https://www.codalogic.com/blog/2022/11/01/Beware-C%2B%2B-Undefined-Behaviour for some examples).

I know you say "I checked and its not because of signed integer overflow either", but how did you check? If you remove the if clause from this program, it will certainly cause signed integer overflow, hence it invokes UB, hence different compilers (in particular, the one used by the online judge) have tremendous leeway in what code to actually compile out of it.

Sorry to hijack this post to speak on this, but you touch on many interesting things.

• I heard that signed overflow is UB in the standard because it's platform-dependent.... The standard makes a formal distinction between "implementation defined behavior" and "undefined behavior". In this case, integer overflow is formally UB, and that places fewer restrictions on what compilers can do with it.

• ...rather than because there's no clear way to interpret it to assembly. That is not typically a cause for declaring something to be UB.

• ...it's more likely to produce bad runtime behavior due to wrong values. I agree 100%. UB is most often a runtime phenomenon. I would expect OP's program to compile on all major compilers. But, what assembly gets emitted can be truly surprising (because UB is present).

If you did not check out the link in my original post, I recommend it. As an example, GCC takes the following code

for (int i = 0; i < 4; ++i){
  int q = i * 1000000000;
  std::cout << q << std::endl;
}

and compiles it into an infinite loop!

UPD from email reach-out: No, but there will be live

My eyes are raped on reading this.

No, its a single online contest.

how much the hacker asks

nice !

We got aucoder123 blog before GTA 6.

just give up then and stop being depressed cp is useless anyways

peak

Both the implementation have the same time complexity.
However, they have drastically different constant factors.
Note: The assembly is generated on godbolt using x86-64 gcc(trunk) with "-std=c++23 -O2".

This is the loop to blame.

for (int k = 1; k <= m; k++)
    for (int i = 1; i <= n; i++)
        for (int j = i + 1; j <= n; j++)
            dis[i][j][k] = dis[j][i][k] = min({dis[i][j][k - 1], dis[i][vs[k - 1][1]][k - 1] + dis[vs[k - 1][2]][j][k - 1], dis[i][vs[k - 1][2]][k - 1] + dis[vs[k - 1][1]][j][k - 1]});

for (int k = 1; k <= m; k++)
{
    int u = x[k][1], v = x[k][2];
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            f[k][i][j] = min({f[k - 1][i][j], f[k - 1][i][u] + f[k - 1][v][j], f[k - 1][i][v] + f[k - 1][u][j]});
        }
    }
}

The faster one performs simpler calculations inside the nested loops.
Here is the assembly of the innermost loop for both versions.

.L153:
    movl    (%r9), %ebx
    movslq  %r8d, %rdi
    imulq   $405, %rdi, %rdi
    movl    %ebx, 84(%rsp)
    movslq  0(%r13), %rdx
    movslq  4(%r13), %rax
    imulq   $405, %rdx, %rcx
    imulq   $164025, %rax, %rsi
    imulq   $164025, %rdx, %rdx
    imulq   $405, %rax, %rax
    addq    %rbp, %rcx
    addq    %rdi, %rsi
    addq    %r10, %rcx
    addq    %r10, %rsi
    addq    %rdi, %rdx
    addq    %rbp, %rax
    movl    dis(,%rsi,4), %esi
    addq    %r10, %rdx
    addl    dis(,%rcx,4), %esi
    addq    %r10, %rax
    movl    dis(,%rdx,4), %edx
    movl    %esi, 88(%rsp)
    addl    dis(,%rax,4), %edx
    cmpl    %esi, %ebx
    leaq    84(%rsp), %rax
    leaq    88(%rsp), %rbx
    movl    %edx, 92(%rsp)
    cmovg   %rbx, %rax
    cmpl    %edx, (%rax)
    cmovg   %r15, %rax
    addl    $1, %r8d
    addq    $656100, %r11
    movl    (%rax), %eax
    movl    %eax, -656100(%r11)
    movl    %eax, (%r9,%r12,4)
    addq    $1620, %r9
    cmpl    %r14d, %r8d
    jle     .L153

.L158:
    movq    8(%rax), %rsi
    leaq    (%rax,%r8), %rdi
    movq    (%r10), %rcx
    addq    8(%rdi,%r13), %rcx
    movq    (%r9), %rdx
    movq    %rcx, 104(%rsp)
    addq    8(%rdi,%r12), %rdx
    cmpq    %rsi, %rcx
    leaq    96(%rsp), %rcx
    cmovl   %r15, %rcx
    movq    %rdx, 112(%rsp)
    movq    %rsi, 96(%rsp)
    cmpq    %rdx, (%rcx)
    leaq    (%rax,%rbx), %rdx
    cmovg   %r14, %rcx
    addq    $8, %rax
    movq    (%rcx), %rcx
    movq    %rcx, 8(%rdx,%rbp)
    cmpq    %r11, %rax
    jne     .L158

Note that the inner loop is run $$$m \times n^2$$$ or $$$6.4 \times 10^7$$$ times!
So, the slower loop takes about $$$10^9$$$ more clock cycles.

Wow thank u for your impressive suggestion! It helps me a lot ^.^

The next guest looks very much like pashka

How would I know if you don’t post from the red account? So for sure not true green

Since I haven't studied FFT, I cant help you there. I have 3-4 upsolves pending on FFT. So I will be studying FFT soon. Once I understand, and implement it, and solve a few problems. I will probably get back to you.

My thinking is that its pretty advanced topic, and below CM, anyone would better focus of DP, Maths, Graphs & Trees, and Data structures.

Auto comment: topic has been updated by luogu_official (previous revision, new revision, compare).

thinking if people always understood that rating is just a side effect for the experience, we would live like in the year 3025.

Bro you are also a cheater.

just +2173 codeforces, please.

Will there be Hyderabadi Biryani?

bro is waiting for a cosmic ray to flip bits on codeforces servers before his interview

https://codeforces.me/blog/entry/98621
https://codeforces.me/blog/entry/136704

A permutation can be partitioned into multiple disjoint cycles. Your solution assumes the given permutation is made up of multiple size 1 or 2 (i == p[i] || i == p[p[i]]) cycles and a big one of size > 2 (in which you count the black nodes with noz). However it fails when you have multiple cycles of size > 2. Here's a testcase:

1
6
2 3 1 5 6 4
000000

the expected output should be 3 3 3 3 3 3, but your solutions prints 6 6 6 6 6 6

and support each other in contests like Codeforces, CodeChef, AtCoder, and more!

wdym lol

Be careful of ARC AGC-ization!

Really nice problems. Any hint for C2?

Hey I can't view others submissions for upsolving, please allow view submissions

Eee Pupil is good rank for interview?

say codeforces god show some respect

I've been coding on Codeforces for more than a year now and have attempted far more contests than all of them combined, who claims their codes got flagged just because their variable names matched, but till date, I have never been flagged. Not just me—my friends, who have been giving contests fairly for over a year, haven't been flagged either.

And to those saying, "How are you so free to write these kinds of blogs?"—yeah, we have enough time even after practicing a bit because we don’t waste it searching for Telegram channels to cheat in the next contest. And on a serious note if someone really thinks their code gets flagged just because of matching variable names just read about the MOSS once.

Hello, just a reminder that the deadline approaches! We hope to have as many competitive programmers as possible joining us for the qualification round!!

i get my account back but you hacked me

I'll need to start ID-ing guests to double check...

Really Nice problems , Loved it !

Also are the standings final? or is it account to some changes yet to be done?

Suffix array in C:/Windows? We forget our history.

Okay

911

+86 110, plz call it at once.

shut your mouth just look these submissions https://codeforces.me/contest/2069/submission/306742302 https://codeforces.me/contest/2069/submission/306745347

don't talk rubbish he clearly cheated both codes are same now if you have courage reply me.

ok GAURAV GHOSH. WE JUST WANTED YOU TO STOP CHEATING. BUT ITS OK ITS YOUR CHOICE AND STOP CREATING ACCOUNTS. AND ALSO DONT WORRY YOUR ACCOUNT WILL NOT GET BANNED.

bros getting edged by codeforces

say daddy please and they might agree trust

How would you recommend a beginner(me) who is not very good at coding(100% MEEE) to start their journey?

hint:

Ok thanks

In fact, doraimota is the alt of Mindeveloped

Amazing journey , Sir ! Big respect for your hard work and dedication . Thanks for sharing!

bro suggestions for me please , i learnt graphs recently from striver after seeing your blog , i didnt learn dsu yet. please tell me topics that i should practise ,please analyse my account once.

Bhai can you take a look at my profile? I want to reach specialist and then expert, I am currently learning dp? What else can I do?

what should i do to become better at data structure and strings? i use C++

is there some material related to those topics

Would you like to list the achievements in the 48th ICPC WF? It seems that some teams(e.g. Naive Birds) won notable rankings in this contest but not listed.

you didn't check if te.first<te.second

yes bro thanks

yes bro thanks

it seems blogs of ABC get less and less upvotes even get downvotes.

Fixed. Thanks. ❤️

Sorry but this blog is really meaningless.

Wtf, I didn't see that. This looks very sus

Every problem has many editorials on luogu. luogu editorials are really great.

You are doing a mistake here , you are not taking input completely. You are comparing arr[i+1][j] etc. directly but you have not taken input for that . In your IDE , you may be using new compiler which sets default value zero or something else , which is not causing trouble . But CF judges are initialsing array with values which are causing trouble .Either use 2D vector , which default initialises to zero (As here zero will not cause trouble because no color is zero here ) or take input first . Issue is of default initialisation .

Nope couldn't figure it out. I think in that case our code is overcounting as if I change my code to min(2, count), it passes but TLEs later.

This may be a sideway trend,do practise instead of asking for prediction.

Why should someone go for a sheet? It's a shit mindset solving a sheet when you can explore all possible problems, every problem teaches you something! CSES and Atcoder are good in teaching you algos but to increase problem solving I am not with solving a sheet.

that was long ago lol.

mine please

Thank you very much!

I actually tried something similiar, and it tled :( The reason is definitely obvious. 306989184

damn is that the old lady from SpongeBob?

One of the few blogs mentioned about practice somewhere else. Maybe this is a little push that I need to actually step out of CF and try out other options (AtCoder, Topcoder archive...).

I've been banging my head against the wall too, even my rating starting to steadily climbing up... But in my perspective, it's no where good. (One might actually say, I hardstuck pupils rank).

Time to explore things out there, out of my comfort zone.

Auto comment: topic has been updated by Enigma27 (previous revision, new revision, compare).

Updated in blog

It is

https://codeforces.me/problemset/problem/1983/D

bro two people can have same approach to a problem doesn't mean they are copying

understood

mine please :))

Maybe I'm the only one waiting for this, but when is the problems rating updated?

Dear JetBrains,

Thank you so much! I successfully received my T-shirt today in Bangladesh.

Proud to be among the luckiest 50 in Kotlin Heroes: Episode 11!

I've found it :). It's in BenQ's template