Closest points

import heapq
def minimum_coverage_distance(points):
    n = len(points)
    seen = set()
    min_heap = [(float('inf'), 0)]
    min_edge = float('inf')
    while len(seen) < n:
        dist, i = heapq.heappop(min_heap)
        if i in seen:
            continue
        seen.add(i)
        min_edge = min(min_edge, dist)
        xi, yi = points[i]
        for j in range(n):
            if j not in seen:
                xj, yj = points[j]
                new_dist = ((xi - xj) ** 2 + (yi - yj) ** 2)
                heapq.heappush(min_heap, (new_dist, j))
    return min_edge

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

    mec = minimum_coverage_distance(points)
    print(mec)

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: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: TIME LIMIT EXCEEDED

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: WRONG ANSWER

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