WIP - Codility - Disc Intersections

codility_disc_intersections.py

def solution(A):
    start_end_points = []
    for i, r in enumerate(A):
        start_end_points.append(((i - r), (i + r)))
    
    end_start_points = list(start_end_points)
    start_end_points.sort(key=lambda v: v[0])
    end_start_points.sort(key=lambda v: v[1])
    
    oc = 0
    l = len(start_end_points)
    for i in range(l-1):
        for j in range(i+1, l):
            if end_start_points[i][1] >= start_end_points[j][0]:
                oc += 1
                if oc > 10000000:
                    return -1
            else:
                break
    
    return oc