Thanks for all the answers I got from the author! Again…I’m having a problem matching the judge data on 18.6 the gasp problem. From the failure cases I got it seems that the checker doesn’t check other feasible solutions.
For example. at line 49 of the test data
[1, 1, 2] [40, 20, 20] 1 TODO
Greedy algorithm yields start point at 1 but starting from 2 would also make the trip in a way that there is 1 gallon left when city 0 is reached and that would make up for the shortage of gas in city 0 .