Minimum Cost of a Path With Special Roads

Find the minimum cost to go from start to target in a 2D grid where moving anywhere costs Manhattan distance but there are directed "special roads" (fixed-cost shortcuts between given points, reusable) that may reduce cost. Model start, target and all road endpoints as graph nodes with edges for Manhattan distances and directed special-road edges, then compute the shortest path (e.g., Dijkstra).