War in Treeland Again

CodeChefRating 2736Open on judge ↗

There is a full-scale war taking place in Treeland. Chef needs to travel between cities in Treeland to work, but during the war, it is not safe. In Treeland, there are $N$ cities (numbered $1$ through $N$) and $N - 1$ bidirectional roads connecting them in such a way that Chef can reach each city from any other city using these roads. Each road is occupied by a unique faction that assigned a posi

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