Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
Delivery Drone solution in Clear category for Delivery Drone by JimmyCarlos
import itertools
def delivery_drone(A):
packages = [(i,v) for i,v in enumerate(A) if i != v != 0]
best_cost = float("inf")
for package_order in itertools.permutations(packages,len(packages)):
cost,drone_position = 0,0
for package_position,package_destination in package_order:
cost += abs(package_position-drone_position)
cost += abs(package_destination-package_position)
drone_position = package_destination
cost += drone_position # Time to head home and watch the soaps.
best_cost = min(best_cost,cost)
return best_cost
Aug. 8, 2019
