Samyak Gift Collector

CodeChefOpen on judge ↗

There is a state with **N** cities that resembles a graph, numbered 1 through **N**. The i-th of the **N−1** edges connects vertices **ai** and **bi**. Currently, there are **Ai** gifts placed in the city **i**. Determine whether it is possible to collect at least **K** gifts from the cities by repeatedly performing the following operation: Select a pair of different leaves or corner cities.

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