Maximum Coins Heroes Can Collect

Given a map with coin values and multiple heroes that can move under specific step/time or path constraints, compute the maximum total coins collectible by coordinating their routes without double-counting coins or violating movement rules. This requires optimizing assignments and paths — typically solved with dynamic programming/state-compression or graph techniques like max-flow/min-cost flow depending on the exact constraints.