Closest points

import math
from bisect import bisect_left, bisect_right, insort

def closest_pair(points, n):
    points.sort(key=lambda p: (p[0], p[1]))
    active = []
    best_sq = float('inf')
    left = 0


    for i in range(n):
        x, i = points[i]
        D = math.isqrt(int(best_sq)) + 1 if best_sq != float('inf') else float('inf')

        while left < i and x - points[left][0] >= D:
            tup = (points[left][1], points[left][0])
            pos = bisect_left(active, tup)
            if pos < len(active) and active[pos] == tup:
                del active[pos]
            left +=1

        lo = bisect_left(active, (y - D, -math.inf))
        hi = bisect_right(active, (y + D, math.inf))

        for yj, xj in active[lo:hi]:
            dx = x - xj
            dy = y - yj
            d2 = dx * dx + dy * dy
            if d2 < best_sq:
                best_sq = d2

        insort(active, (y,x))

    return int(best_sq)




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

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: TIME LIMIT EXCEEDED

Test 3

Verdict: TIME LIMIT EXCEEDED

Test 4

Verdict: TIME LIMIT EXCEEDED

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: TIME LIMIT EXCEEDED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: ACCEPTED

Test 10

Verdict: TIME LIMIT EXCEEDED

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: ACCEPTED

Test 13

Verdict: TIME LIMIT EXCEEDED

Test 14

Verdict: WRONG ANSWER

Test 15

Verdict: WRONG ANSWER

Test 16

Verdict: TIME LIMIT EXCEEDED

Test 17

Verdict: TIME LIMIT EXCEEDED

Test 18

Verdict: WRONG ANSWER