Black-and-White Tree

CodeChefRating 2921Open on judge ↗

Chefland is a country with $N$ cities (numbered $1$ through $N$) connected by $N-1$ bidirectional roads. It is possible to travel from each city to any other city using the roads. Moreover, each city is specialised in either black or white chocolate. Chef wants to construct three new restaurants. However, he is still not sure where to build them. You should answer $Q$ queries; in each query, Ch

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