Closest points

def euclidean_distance(first, second):
    return pow((first[0] - second[0]),2) + pow((first[1] - second[1]),2)

n = int(input())
points = []
distances = set()

for _ in range(n):
    (x, y) = map(int,  input().split())
    points.append((x,y))

print(points)

for i in range(n):
    for j in range(n):
        if i == j:
            continue
        distance = euclidean_distance(points[i], points[j])
        distances.add(distance)

print(min(distances))

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