On general graphs, you might need multiple cops to catch the robber. The cop number of a graph is the minimum number of cops needed to guarantee capture. Planar graphs have cop number at most . General graphs can have cop number up to .
Computing the cop number is NP-hard. For competitive programming, you usually have specific graphs and need to determine if a given number of cops can catch the robber.