Codeforces Round 787(Div-3) Solutions || Problems D,E, and F

[@rohandsouza9147]

E problem was very interesting today, really enjoyed solving it, got AC Verdict in last two mins(best feeling ever).

[@andrejvarga8781]

So clean code and well explained problem F, awesome!!!

[@hirenachhada9180]

F Problem explained in very nice manner nice to see this much new concepts :)

[@Anonymous____________A721]

Now?

[@prakash_77]

You can simplify the implementation of F by taking y as a special node in addition to the other k nodes. That way, you'd just have to subtract the simple distance from x to y at the end.

[@yashtote9682]

Hi harisham!! Is rooting tree ( in problem F) a specific technique to solve these types of problem?? Can you please answer. Thank You!

[@saketkumarsingh2149]

sir, I didn't get what is the special node which you are talking about in question F

[@5590priyank]

For D, we can start with each leaf node, and visit its parent until we find not visited parent.

[@arutsudar]

Nice explanation and neat code on Problem E. One minor correction at 07:50 - Reduce all occurrences of "z" and reduce it to "y". Or, Reduce all occurrences of "a" and reduce it to "z". (Not "z" to "a")

[@Harisamsharma]

Sure, thanks!

[@himanshushekhar5875]

Always Op 😎😎😎

[@yourbestie4138]

very intuitive as always

[@dongripavankumar9342]

Please make tutorial on problem G Sorting Pancakes. Thanks

[@siddharthmagadum16]

+1

[@ishitajhunjhunwala1073]

+1

[@soumyadeepdash4805]

Thanks for the problem F ....I' m struggling with it since 1 hour but didn't find anything close to solution

[@satyampal7235]

Awesome as always

[@nishantsahoo3835]

06:00 I got MLE due to passing the adjacency list too as argument :(

[@rohandsouza9147]

You can pass it by reference

[@trueevil2590]

Does problem F require understanding of graph algorithms ??

[@Anonymous-pj2mv]

yes