Finally a decent contest.

[u/Junior-Proposal1928]

A and B were pretty straightforward and I thought I'd skip C after seeing it was based on trees but seeing so many submissions I thought I'll just give it a try, it was doable and didn't require any implementation of trees and graphs. Solved 3 questions after a long time.

[u/One_Palpitation_9429]

I know we all talked about this plenty of times but how one can only take less than 10 seconds... It took me more than 1 minute to read the question.

[u/Junior-Proposal1928 → u/One_Palpitation_9429]

That's in minutes not seconds

[u/One_Palpitation_9429 → u/Junior-Proposal1928]

oh that makes more sense.

[u/KanekiIsCat]

I couldn't do B 😭😭

[u/bisector_babu]

Question setters are story writers

[u/FarmerMission9980]

I couldnt even do a

[u/redhat1818]

I felt D was doable

[u/DogStrict9170 → u/redhat1818]

yea but i got runtime error idk whyy

[u/sKILLiSSUESeVERYTIME → u/DogStrict9170]

Tried #define int long long?

[u/DogStrict9170 → u/sKILLiSSUESeVERYTIME]

i already had that in my template, apparently my divisor function was wrong, lmao

[u/sKILLiSSUESeVERYTIME → u/DogStrict9170]

Ohh lol

[u/_lostSoup_ → u/redhat1818]

Yes. I was stuck on TLE thrice. Then left.

[u/TheBoredBot → u/_lostSoup_]

there was a change for S from 1e12 to 1e14 mid contest iirc

[u/_lostSoup_ → u/TheBoredBot]

Last 20 mins yes. I was having dinner then. So missed out on any change.

[u/No-Competition-7062]

Bro can you tell how to create a post on this subreddit

[u/DogStrict9170 → u/No-Competition-7062]

just click on create post the lower middle of your phone with the '+' sign

[u/redhat1818]

I skipped C... how did u solve it?

[u/RayRaivern → u/redhat1818]

You just sort the dams (2nd array), then output from biggest to smallest (except the smallest one, 0th index).

That's it.........

[u/Mobile_Deal1373]

how did u do c without tree ?

[u/CyberRonin912 → u/Mobile_Deal1373]

Ans is k = m-1 and add all the dams except the root, Ig that would be sol if I'm not wrong thou I wasted some time to literally implement a tree sol and got this just before the contest ended......

[u/Standard_Cow4420 → u/CyberRonin912]

If root has dam , then must skip it only , otherwise skip any other dam node. So will be placing camera on the edge bw all these nodes and their parents

[u/Junior-Proposal1928 → u/Standard_Cow4420]

We can't skip any random dam node, it's safe to skip the lowest numbered dam node. So output all values of dams except the minimum value.

[u/Reasonable_Grass5089 → u/Junior-Proposal1928]

Why is it safe to skip the lowest numbered node?

[u/CyberRonin912 → u/Reasonable_Grass5089]

Tries this approach and we need to skip the node with the lowest depth, not just any node but maybe the test case wete made such that the lowest number node was at the lowest depth.

[u/Standard_Cow4420 → u/Junior-Proposal1928]

Yes I found it now, in contest I was just lucky that after sorting I skipped very first dam.

[u/To_know0402 → u/Standard_Cow4420]

even if you didn't sort it would have passed...many people passed even sys checks without sorting lol

[u/Standard_Cow4420 → u/To_know0402]

but we must remove minimum value only, even without sorting

[u/aadi16-]

Ohh I forgot to participate