Hunting Race

CodeChefOpen on judge ↗

Once in the Tokyo city Group of Ghouls i.e $Goat$ is being hunted by CCG (police of the Tokyo city) and now the group is hiding in the $x$-th division of the city. The city contains n divisions which are connected with m bidirectional roads, and Kaneki doesn’t want $Goat$ to get hunted by CCG, whenKaneki comes to know that police from $z$-th division of the city is heading towards the $x$-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