Maintaining Roads

CodeChefOpen on judge ↗

In a kingdom, there are N cities, numbered from 1 to N, with some pairs of them connected by bidirectional roads, the lengths of which are known. The cost of maintaining a road is 1 per unit length. The capital of the kingdom is city 1. Now the king wishes to maintain only some roads such that : - He himself does not like treading roads not maintained. Thus, there should be a path from the capita

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