Chef and Tree Game

CodeChefRating 2860Open on judge ↗

Chef has a rooted tree G, consisting of N vertices. Each edge of the tree has a color black or white. Once Chef's friend Ksen offered Chef to play a game on the tree G. The game has very simple rule: - The players make moves in the game alternately. - On his move Chef deletes a single undeleted black edge. On her move Ksen deletes a single undeleted white edge. - When some edge has been delete

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