Company: uber_3sep
Difficulty: medium
Minimum Total Travel Time Problem Description At Uber, drivers are often required to complete multiple pickups or drop-offs in a specific sequence before reaching their final destination. The city is represented as an undirected road network graph, where intersections are nodes and roads are weighted edges representing travel times. The driver always starts at node 1 (their initial location). The final destination (the last rider drop-off) is always node r_nodes . The driver must visit two required stops in order: First stop at node x (e.g., rider pickup). Second stop at node y (e.g., intermediate rider drop-off). You are given: r_nodes : the number of intersections in the city. r_from[i] and r_to[i] : the two intersections connected by the i-th road. r_weight[i] : the travel time along that road. Task Compute the minimum total travel time for the driver to go from: Start (node 1) → Stop x → Stop y → Final Destination (node r_nodes ). The driver may pass through intersec