Our AAA company is in need of some software to help with logistics: you will be given the width and height of a map, a list of x coordinates and a list of y coordinates of the supply points, starting to count from the top left corner of the map as 0.
Your goal is to return a two dimensional array/list with every item having the value of the distance of the square itself from the closest supply point expressed as a simple integer.
Quick examples:
```python
logistic_map(3,3,[0],[0])
#returns
#[[0,1,2],
# [1,2,3],
# [2,3,4]]
logistic_map(5,2,[0,4],[0,0])
#returns
#[[0,1,2,1,0],
# [1,2,3,2,1]]
```
Remember that our company is operating with trucks, not drones, so you can simply use Manhattan distance. If supply points are present, they are going to be within the boundaries of the map; if no supply point is present on the map, just return `None`/`nil`/`null` in every cell.
```python
logistic_map(2,2,[],[])
#returns
#[[None,None],
# [None,None]]
```
**Note:** this one is taken (and a bit complicated) from a problem a real world AAA company [whose name I won't tell here] used in their interview. It was done by a friend of mine. It is nothing that difficult and I assume it is their own version of the FizzBuzz problem, but consider candidates were given about 30 mins to solve it.
def logistic_map(width,height,xs,ys):
    # kind of a brute force solution but hey
    
    supply_stops = zip(*[xs,ys])
    points = [[None for x in range(width)] for x in range(height)]
    
    for s in supply_stops:
        for i in range(width):
            for j in range(height):
                d_cur = abs(s[0] - i) + abs(s[1] - j)
                d_pnt = points[j][i]

                if (d_pnt == None) or (d_cur < d_pnt):
                    points[j][i] = d_cur
    return points
def logistic_map(width,height,xs,ys):
    # kind of a brute force solution but hey
    
    supply_stops = zip(*[xs,ys])
    points = [[None for x in range(width)] for x in range(height)]
    
    for s in supply_stops:
        for i in range(width):
            for j in range(height):
                d_cur = abs(s[0] - i) + abs(s[1] - j)
                d_pnt = points[j][i]

                if (d_pnt == None) or (d_cur < d_pnt):
                    points[j][i] = d_cur
    return points