Problem 1928 · Hard
Track the cheapest arrival at each city for each exact elapsed time, then read the destination column.
Open the interactive visualisation