← All problemsSign in

Cost Distribution

CodeChefRating 2602Open on judge ↗

There are $N$ towns connected by $M$ **bidirectional** roads. There is **at least one** path between each pair of towns and no pair of towns are directly connected by more than one road. Under a new law, all roads need to be improved. The cost of improving a road can be determined as $C\times L$, where: - $C$ is the number of pairs of towns that would be unable to trade if this road were damag

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

Sign in to chat with the tutor and save your progress.

Sign in to start