AuckDunia

CodeChefOpen on judge ↗

NoOne recently became head of auckDunia. auckDunia has N cities. auckDunia is connected by M roads such that you can visit from any city to another and each road has some cost which had to paid to use that road. To travel between city A and city B people have to pay money corresponding to the roads that they used to travel. Now, people don't want to waste money. They want to reach from city A and

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