-
Notifications
You must be signed in to change notification settings - Fork 0
/
best_car.py
50 lines (39 loc) · 1.52 KB
/
best_car.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
from sys import argv
from util import Ride, Car, validate, dist, read, write
def getBestCar(ride, cars, T):
start, end = ride.from_pos, ride.to_pos
distToStart = dist(start, cars[0].pos)
carIndex = 0
for x in range(1, len(cars)):
distToCar = dist(start, cars[x].pos)
if(distToStart > distToCar):
stepsToTake = distToCar + dist(start, end)
if((stepsToTake + cars[x].steps) <= T):
distToStart = distToCar
carIndex = x
return carIndex
def moveCar(carIndex, cars, ride):
steps = dist(ride.from_pos, cars[carIndex].pos) + dist(ride.from_pos, ride.to_pos)
cars[carIndex].pos = ride.to_pos
cars[carIndex].steps = steps
def bestCarSolve(rides_clone, F, B, T):
rides = [ride for ride in rides_clone]
rides.sort(key=lambda x: x.start)
vehicles = [[] for i in range(F)]
cars = [ Car(0, 0, 0) for i in range(F)]
while len(rides) > 0:
ride_index = 0
ride = rides.pop(ride_index)
closestCar = getBestCar(ride, cars, T)
moveCar(closestCar, cars, ride)
vehicles[closestCar].append(ride.index)
return [ [len(vehicle), *vehicle] for vehicle in vehicles]
if __name__ == "__main__":
fname = 'inputs/a_example.in'
if len(argv) == 2:
fname = argv[1]
R, C, F, N, B, T, rides = read(fname)
vehicle_rides = bestCarSolve(rides, F, B, T)
score = validate(rides, vehicle_rides, B, T)
print("{:,}".format(score))
write('outputs/' + fname.split('/')[1], vehicle_rides)