Problem 3112 · Medium

Minimum Time to Visit Disappearing Nodes

Dijkstra from node 0, refusing any arrival at or after the node’s disappearance time, so every reported time is the earliest safe visit.

Open the interactive visualisation