New City

CodeChefOpen on judge ↗

Chef has a problem with the new city he has invented. The city has N buildings and there are bridges which connect some pair of buildings in such a way that there is exactly one path between any pair of buildings. (i.e. They form a tree). All bridges are of equal length. Distance between two buildings is the sum of lengths all bridges connecting the two buildings. Now chef wants to find for each b

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