HashcodeOdt/ride.py at master · Jeremyy55/HashcodeOdt · GitHub

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

from handleFile import *
from forCar import *

def init(tab):
	car=[]
	for i in range(int(tab)) :
		car.append([0,0,0])
	return car

def feasable(car, ride):
	move1=int( deplacement([int(car[0]),int(car[1])],[int(ride[0]),int(ride[1])]))
	move2=int( deplacement([int(ride[0]),int(ride[1])],[int(ride[2]),int(ride[3])]))
	if(car[2]+move1+move2)<int(ride[5]):
		return True
	else:
		return False
def goForRide(cars,rides,car2modif,ride2delete):
	car= cars.index(car2modif)
	move1=int( deplacement([int(car2modif[0]),int(car2modif[1])],[int(ride2delete[0]),int(ride2delete[1])]))
	move2=int( deplacement([int(ride2delete[0]),int(ride2delete[1])],[int(ride2delete[2]),int(ride2delete[3])]))
	cars[car][2]=cars[car][2]+ move1 + move2
	rides.remove(ride2delete)
	return cars, rides


def main():
	damn = text2lines("data/a_example.in")
	[R, C, F, N, B, T], already = extract1line(damn)
	car = init(F)
	print(feasable(car[0],already[0]))

if __name__ == '__main__':
	main()