Closest points

import math

def compareX(a, b):
    return (a[0] != b[0]) * (a[0] - b[0]) + (a[1] - b[1])

def compareY(a, b):
    return (a[1] != b[1]) * (a[1] - b[1]) + (a[0] - b[0])

def dist(p1, p2):
    return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2


def bruteForce(P, n):
    min_dist = float('inf')
    for i in range(n):
        for j in range(i+1, n):
            min_dist = min(min_dist, dist(P[i], P[j]))
    return min_dist


def stripClosest(strip, size, d):
    min_dist = d

    for i in range(size):
        for j in range(i+1, size):
            if (strip[j][1] - strip[i][1]) < min_dist:
                min_dist = min(min_dist, dist(strip[i], strip[j]))

    return min_dist

def closestUtil(Px, Py, n):
    if n <= 3:
        return bruteForce(Px, n)

    mid = n // 2
    midPoint = Px[mid]

    Pyl = [None] * mid 
    Pyr = [None] * (n-mid) 
    li = ri = 0
    for i in range(n):
        if ((Py[i][0] < midPoint[0] or (Py[i][0] == midPoint[0] and Py[i][1] < midPoint[1])) and li < mid):
            Pyl[li] = Py[i]
            li += 1
        else:
            Pyr[ri] = Py[i]
            ri += 1


    dl = closestUtil(Px, Pyl, mid)
    dr = closestUtil(Px[mid:], Pyr, n-mid)

    d = min(dl, dr)

    strip = [None] * n
    j = 0
    for i in range(n):
        if abs(Py[i][0] - midPoint[0]) < d:
            strip[j] = Py[i]
            j += 1

    return stripClosest(strip, j, d)

def closest(P, n):
    Px = P
    Py = P
    Px.sort(key=lambda x: x[0])
    Py.sort(key=lambda x: x[1])

    return closestUtil(Px, Py, n)

if __name__ == "__main__":
    n = int(input())
    points = []
    for _ in range(n):
        x, y = map(int, input().split())
        points.append([x, y])

    mec = closest(points, n)
    print(mec)

Test 1

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "input/code.py", line 79, in <module>
    mec = closest(points, n)
  File "input/code.py", line 70, in closest
    return closestUtil(Px, Py, n)
  File "input/code.py", line 46, in closestUtil
    Pyr[ri] = Py[i]
IndexError: list index out of range

Test 2

Verdict: TIME LIMIT EXCEEDED

Test 3

Verdict: TIME LIMIT EXCEEDED

Test 4

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "input/code.py", line 79, in <module>
    mec = closest(points, n)
  File "input/code.py", line 70, in closest
    return closestUtil(Px, Py, n)
  File "input/code.py", line 46, in closestUtil
    Pyr[ri] = Py[i]
IndexError: list index out of range

Test 5

Verdict: ACCEPTED

Test 6

Verdict: TIME LIMIT EXCEEDED

Test 7

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "input/code.py", line 79, in <module>
    mec = closest(points, n)
  File "input/code.py", line 70, in closest
    return closestUtil(Px, Py, n)
  File "input/code.py", line 46, in closestUtil
    Pyr[ri] = Py[i]
IndexError: list index out of range

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: TIME LIMIT EXCEEDED

Test 11

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "input/code.py", line 79, in <module>
    mec = closest(points, n)
  File "input/code.py", line 70, in closest
    return closestUtil(Px, Py, n)
  File "input/code.py", line 50, in closestUtil
    dl = closestUtil(Px, Pyl, mid)
  File "input/code.py", line 46, in closestUtil
    Pyr[ri] = Py[i]
IndexError: list index out of range

Test 12

Verdict: ACCEPTED

Test 13

Verdict: TIME LIMIT EXCEEDED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "input/code.py", line 79, in <module>
    mec = closest(points, n)
  File "input/code.py", line 70, in closest
    return closestUtil(Px, Py, n)
  File "input/code.py", line 50, in closestUtil
    dl = closestUtil(Px, Pyl, mid)
  File "input/code.py", line 50, in closestUtil
    dl = closestUtil(Px, Pyl, mid)
  File "input/code.py", line 46, in closestUtil
    Pyr[ri] = Py[i]
IndexError: list index out of range

Test 16

Verdict: TIME LIMIT EXCEEDED

Test 17

Verdict: TIME LIMIT EXCEEDED

Test 18

Verdict: ACCEPTED