Battle of Sages

CodeChefOpen on judge ↗

"Your duty is not over!" — Sage Given a tree having $N$ nodes numbered from $1$ to $N$, nodes represent cities. Radiant Sage and Kingdom Sage are assigned the task to resurrect the entire lot of cities. - It takes an entire day to resurrect a city. - Radiant Sage will resurrect a city only on odd numbered days and Kingdom Sage will resurrect a city only on even numbered days. - On day $1$,

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