← All problemsSign in

Game of Stones

Satkkeerthi has decided to participate in the Game of Stones. There are $n$ cities numbered $1$ to $n$ and $m$ $directed$ $roads$ between the cities. There is an infinitely large pile of stones in each city, of one particular colour. Each colour is described by a colour code, ai at the ith city. A player must choose a path starting from one city, and at every city along the path, he/she adds one

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

Sign in to chat with the tutor and save your progress.

Sign in to start