Dealers Dilemma

CodeChefOpen on judge ↗

There is a country of N cities which are connected by M bidirectional roads each having a toll cost associated with it. In this country, to travel in any path a person needs to pay the cost of $only$ $1$ road in the path which the person chooses. There are $K$ dealers present in different cities who are allegedly involved in illegal activities. Each Dealer has to travel to any $one$ other deale

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI