Friendly Spiders || Codeforces Round 843 Div2 Problem D

[@GGxEpsilon]

Discord Link: 🔗
discord.gg/aFBTauq

[@user_helloworld_]

Sir Can you please give approach for this problem :
Given Array of integers (N

[@sainithyamsani4062]

explanation is super. plz share those kind of tricks with us. thank you.

[@competitivecoding-newtonsc9601]

Thanks 🙏

[@rahulkhandelwal7034]

Thanks for the explanation man :)

[@competitivecoding-newtonsc9601]

Happy to help!

[@xd-qq3cu]

gr8 explanation can u tell that utkarsh sir video also, thank sir!

[@competitivecoding-newtonsc9601]

That was way back man, not really sure if i can find it now. Will ping the link here if i find it.

[@xd-qq3cu]

@@competitivecoding-newtonsc9601 okay sir thanks a lot!

[@Ishwarsingh-zq5ig]

Sir,
can you explain this line
cout

[@visheshkumargautam1683]

draw the graph,you will see that every second node you visit is a special nodefor example for visiting from a to b lets say n nodes are there that means n/2 special nodes will be there as well

[@LegitGamer2345]

please make video editorial for round 845 D

[@ajay9854]

Thank man🔥🔥🔥

[@competitivecoding-newtonsc9601]

No worries ✌🏻

[@jatin28219o]

cout

[@competitivecoding-newtonsc9601]

dis[tgt] is the number of nodes on the path, not the edges. So it is always odd. And useful nodes on such a path are (dis[tgt] + 1)/2

[@garvitkumargupta3306]

Please provide solution code link also thanks

[@competitivecoding-newtonsc9601]

You can find it from my codeforces profile epsilon_573