Leetcode 1989. Maximum Number of People That Can Be Caught in Tag

Given rules for which people can tag which others (based on positions, times, or movement constraints), compute the largest number of people that can be caught following those rules; the core challenge is to build the directed/catchability graph and reduce the problem to a maximum matching/flow (or equivalent graph/dynamic-programming) computation.