POSTMAN POSSIBLE

CodeChefOpen on judge ↗

There is a postman who has to deliver messages to various houses in a colony. The houses are represented by nodes of the tree. Postman enters the colony from house $1$, i.e House $1$ is the root of the colony On each day the postman has a list of houses to which he has to deliver the messages. He is able to deliver all the messages if there is a path from house $1$ to any other house such that eve

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