Nearest-driver dispatch in Jakarta

A ride-hailing dispatcher in Jakarta works along a single long avenue measured in kilometres. Drivers move at exactly 1 km per minute. The dispatch rule decides who waits and who drives, so it must be followed to the letter.

Task: line 1 holds the starting positions of the drivers (integers separated by spaces); driver numbers start at 1 and all drivers are idle at minute 0. Line 2 is the number of requests n. Then n lines t pickup dropoff (request minute and two positions; t never decreases). Requests are handled strictly one at a time in input order. Request i is assigned at moment A_i, the earliest moment that is at least its own t, at least A_(i-1) (use 0 for the first request) and at which some driver is idle; a driver whose trip ends at minute x is idle from minute x on. Among the idle drivers choose the one closest to the pickup position; ties go to the lowest driver number. That driver reaches the pickup at A_i + distance, so the passenger's wait is A_i + distance - t, then drives to the dropoff (taking |pickup - dropoff| minutes), becomes idle there and stays at the dropoff position. Print Request i: driver j wait w for each request (i from 1), then Average wait: X (2 decimals) and Final positions: p1 p2 ... in driver order.