Closest points

#include <bits/stdc++.h>
using namespace std;

typedef long long C;
typedef complex<C> P;
#define X real()
#define Y imag()

/**
 *
 * import sys
 
n = int(input())
points = []
for _ in range(n):
    x, y = map(int, input().split())
    points.append((x, y))
 
def square_distance(x1, y1, x2, y2):
    return (x1 - x2) ** 2 + (y1 - y2) ** 2
 
min_square_distance = sys.maxsize
points.sort(key=lambda p: p[0])
 
for i in range(n):
    for j in range(i - 1, 0, -1):
        if points[i][0] - min_square_distance <= points[j][0]:
            square_dist = square_distance(points[j][0], points[j][1], points[i][0], points[i][1])
            min_square_distance = min(min_square_distance, square_dist)
        else:
            break
 
 
print(min_square_distance)
 */


struct point {
    long long x;
    long long y;
};

long long d2(const point& a, const point& b) {
    point ab = {a.x - b.x, a.y - b.y};
    return ab.x*ab.x + ab.y*ab.y;
}

bool cmp(const point&a, const point&b) {
    return a.x < b.x;
}

int main() {
    int n;
    cin >> n;

    vector<point> points;

    for(int i =0; i < n; i++) {
        long long x, y;
        cin >> x >> y;
        points.push_back({x, y});
    }

    long long mind2 = LLONG_MAX;

    sort(points.begin(), points.end(), cmp);

    // for (const auto& point : points) {
    //     cout << point.x << ' ' << point.y << '\n';
    // }

    for(int i = 0; i < n; i++) {
        for(int j = i-1; j >=0; j--) {
            if(points[i].x - mind2 <= points[j].x) {
                long long sd = d2(points[j], points[i]);
                mind2 = min(mind2, sd);
            }
            else break;
        }
    }

    cout << mind2 << '\n';

    return 0;
}

/**
 * for i in range(n):
    for j in range(i - 1, 0, -1):
        if points[i][0] - min_square_distance <= points[j][0]:
            square_dist = square_distance(points[j][0], points[j][1], points[i][0], points[i][1])
            min_square_distance = min(min_square_distance, square_dist)
        else:
            break
 */

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: ACCEPTED

Test 3

Verdict: WRONG ANSWER

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