Closest points

# n = int(input())
# points = []
# for i in range(n):
#     a, b, c, d = map(int, input().split())
#     points.append([a, b, c, d])
#
# min_distance = 10**9
# distance = 0
#
# for i in range(n):
#     for j in range(n):
#         for k in range(n):
#             for l in range(n):
#                 distance += points[i][j][k][l] + points[i][j][k][l]
#             if distance < min_distance:
#                 min_distance = distance
#
# print(distance)




######


import sys

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


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


points.sort()

min_square_distance = sys.maxsize

for i in range(n):
    j = i - 1
    while j >= 0:
        dx = points[i][0] - points[j][0]
        if dx * dx >= min_square_distance:
            break

        min_square_distance = min(min_square_distance, square_distance(points[i], points[j]))
        j -= 1

print(min_square_distance)

Test 1

Verdict: ACCEPTED

Test 2

Verdict: TIME LIMIT EXCEEDED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: TIME LIMIT EXCEEDED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: TIME LIMIT EXCEEDED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: TIME LIMIT EXCEEDED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED