Pika-Pika

CodeChefOpen on judge ↗

It's battle time and Pikachu has to win this time. Ash is ready with his challenge, and this time the challenge is to collect maximum Poke-coins. Ash has laid down $N$ Poke-stops, each with a unique label from $1$ to $N$ and exactly one Poke-coin. There are $N-1$ roads laid down, such that there exists a path from each Poke-stop to every other Poke-stop. The Poke-coin at $ith$ Poke-stop is guarded

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