As x can be of the order 1e18 wouldn't O(√n) will be of the order 1e9? which should TLE?

What in the world is pretest 2 for F1 D: ;-;

I figure the api design. But how will I know the ID is of your comment lol.

replying to find it later.

p.s -> how to find a particular comment easily later ?

Going through all the unvisited edges is alredy n^2, checking for cycle makes it n^3 but i'm not sure if it's mathematically n^3 only or not. Rather, just check if it's part of different trees or not by mantaining array marking some sort of tree number for every node and mantain this array. Again, not exactly sure what the complexity will look like for this.

Can you please brief your approach without segment tree for D.

Thanks helpful very

Can anybody explain how this range based segment tree works, editorial doesn't talks about it

Its educational round, that's why !

Can you show any multiset solutions which passed ?

+100, CF interface warm and easy.

Lmao, didn't see this coming at all

In the "Rock Paper Scissor" problem, for the DP transactions there is no proof provided that the optimal answer for a particular state is resolvable from one of the exact previous state. I don't see why that would be the case always.

Your performance is the perfect depiction I have seen of the constant reminder everyone gives but hard to follow of "reading all the problems". Good job lol

You are right, it's the initialisations ;_; ;_; I'll cry myself to sleep now ;_;

you are right about that it shouldn't TLE ! I did the same thing as you and i got TLE in pretests. ;_; Really not sure what went wrong. https://mirror.codeforces.com/contest/1527/submission/116811751

I agree, even tho i solved it, it felt very vague.

The part where you talk about Sj(!=j) is why he is multiplying it by the factor \Pi_{0 \leq i \leq k}{g(S_i, S_i)} \cdot \frac{(\sum S_i)!}{\Pi(S_i!)}. According me this incorporates for a particular partition. There can be a lot of partitions which I don't know how he is accounting them

I don't understand the part where you just defined h(k). Is it a known mathematical fact? How did you come up with that, also it doesn't talk about how for a given k you consider all the possible ways of dividing array in k parts, which I think by stars and bars is n-k+1Ck-1

Is this a fft solution?

You should contact the problem setter for that

Also, I read at someplaces that sorting doubles is costly. Is that true?

why is it that the vector of double givees tle?

and why is that?

anybody who can explain what's the deal with using Fast io and setprecision together resulting in TLE for C ??

Same with me . Help !

I will not respect the platform and I'll not leave either. What can u do about it Mr. Authority?

We often get stressed during or even before the contests, which leads to frustration. Keeping that in mind and not to forget the constant delays today i would like to appologise to absolutely nobody, do what u can , the king does what he wants.

codeforces randi ,start krrde

i feel so stupid now :(, I highly appreciate the help man. Thanks.

Thank you cf to yet again remind me to no never use float even in my dreams

Why do I get TLE on main test cases for problem B? What the hell man! I don't think this was supposed to happen

Edit: my solution is cpp !!

lol

greedy solution worked for me

Excuse me! Why is E like A in terms of difficulty?

Solved only 2, I put a lotttt of time on problem 5th, but couldn't converge to an answer.

I'm so mad at my stupidity.

Whhhhhaaattttttttttt, whyyyyy,come on codeforces (ノ｀Д´)ノ彡┻━┻

For problem C — if there are two centroids then we disconnect the leaf of 1 centroid and connect it directly to the other centroid. How does this not works ?

Yes, could we please get a clarification for this from someone with authority.

This guy solved every problem in this 12 hours long youtube video. https://www.youtube.com/watch?v=oY0PBQt36YM

Did you mean to say something like, "I would like algorthmic problems better than maths problem", i feel more or less it's all maths.

how do you prove that that's the best C . edit : you failed main tests, F

same here

My B , failed in main test cases :(((

Thanks for the best B ever. Must say it was a bit humiliating when i started solving it first but it turned out to be the best decision of my life when i decided to move on to C rather :) .

Each time a contest is delayed by 10 minutes, adrenaline of thousands of participants goes straight to the flush. edit: GG codeforces lol.

it's not rage quit if you don't shatter your laptop / monitor. Atleast break a keyboard.

fuuuuuuuuuuuuu,.... , this C , damn itttt.

the order of coloring will remain as given.

Interesting, if someone could throw a light it'd be great.

So someone replaced D with C .

n^2

Logic behind soulution of C?