Problem 3651 · Hard

Minimum Cost Path with Teleportations

Layer the grid by the number of teleports used: inside each layer run a right-and-down DP, and let a teleport jump to any cell no larger than the current one.

Open the interactive visualisation