Bounty Hunters

CodeChefOpen on judge ↗

You are the member of an organization called Akatsuki and you are sent to a journey to catch the jinchuriki. You have a map where you can find the ways to reach the jinchuriki. You want to choose the path through which you can acquire maximum amount of money by catching the shinobis from the villages in the path. This map of yours is a tree of N nodes(villages) rooted at your hideout **(Wh

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