Police Catching Thief

CodeChefOpen on judge ↗

A thief is trying to escape the holds of the police through a city. Let’s assume we represent our city by a weighted undirected connected graph(with no self-loops and multi-edges) with N nodes and M edges. Thief is currently at vertex numbered S and needs to reach vertex numbered D. Thief moves with constant speed VT = 1. K policemen are initially located in K distinct locations denoted by A1, A

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