1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374 |
- # You lost the game.
- from math import *
- # Parser
- def parse(file_name):
- """ Open the file and parse it"""
- f = open(file_name)
- line = f.readline()
- rows, cols, drones, turns, max_payload = map(int,line.split(' ') )
- line = f.readline()
- products = line.split(' ')
- line = f.readline()
- products = map(int, line.split(' ') )
-
- line = f.readline()
- warehouse_nb = int(line.split(' ')[0])
- warehouses = {}
- for i in range(warehouse_nb):
- line = f.readline()
- pos = map(int, line.split(' ') )
- line = f.readline()
- products = map(int, line.split(' ') )
- warehouses[i] = (pos, products)
-
- line = f.readline()
- products_nb = int(line.split(' ')[0])
- orders = []
- for i in range(products_nb):
- line = f.readline()
- pos = map(int, line.split(' ') )
- line = f.readline()
- line = f.readline()
- items = map(int, line.split(' ') )
-
- orders.append((pos, items))
-
- return rows, cols, drones, turns, max_payload, products, warehouses, orders
- # Lecture
- #f = open("busy_day.in","r")
- #f = open("mother_of_all_warehouses.in","r")
- #f = open("redundancy.in","r")
- #f.close()
- # Traitement
- def distance(r1,c1,r2,c2):
- return ceil(sqrt((r2-r1)**2+(c2-c1)**2))
- def tours_ecoules(drone, commande):
-
- # Écriture
- #f = open("output.txt","w")
- #f.close()
|