This year's question is about request-vehicle matching for cars. Basically, we are given a grid as map, a number of vehicles, and a list of requests, and we are required to find the best matching given an evaluation function. The detailed problem statement can be found here. Below we present our iteration over solving the problem.
python solution.py <input-filename>.in
The program will write the solution to <input-filenamme>.out.
At first, we proposed a greedy method to select the vehicle with highest score given a time for a request.