Problem 3977 · Hard

Minimum Time to Reach Target With Limited Power

Travel along directed edges. Each departure drains power from the vertex you leave, so track time and remaining power together and report the fastest arrival with the most power left.

Open the interactive visualisation