Broken Heart

CodeChefRating 2574Open on judge ↗

Abhijeet just got his heart broken recently and thus he decided to make a hard problem this time. The problem is stated below : A tree containing N nodes and rooted at node 1 is given. On each node of the tree, there is a monkey having information about a graph G. G is a graph containing N nodes. The information contained on each node is an edge of the graph G . Now for every node X, consider t

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