Calculate the earliest possible arrival time for each point using Manhattan distance from (0,0) as a baseline, ignoring disappear_time constraints.

After sorting points by disappear_time, use a greedy approach to visit points in order, keeping track of the current time and position. If the current time plus Manhattan distance to the next point exceeds its disappear_time, mark it as unreachable (-1).

Optimize the path by considering that you can visit points out of order if it allows reaching a point before its disappear_time, using a priority queue (min-heap) to always pick the next reachable point with the earliest disappear_time.