Closest points

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <climits>
//#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

ll euclDist(pair<ll,ll> p1, pair<ll,ll> p2){
    return  pow((p1.first - p2.first),2) + pow((p1.second - p2.second),2);
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    ll n;
    cin >> n ;

    vector<pair<ll,ll>> arr(n);
    for(ll i = 0; i < n; i++){
        cin >> arr[i].first >> arr[i].second;
    }

    sort(arr.begin(), arr.end());

    ll d = LLONG_MAX;
    for(ll i = 0; i < n; i++){
        ll it = 1;
        while(i - it >= 0 ){
            ll dist = euclDist(arr[i], arr[i - it]);
            if(abs(arr[i-it].first - arr[i].first) > d) break;
            if(abs(arr[i-it].second - arr[i].second) > d) break;
            d = min(d, dist);
            it++;
        }
    }

    cout << d << endl;
    return 0;

}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: ACCEPTED

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED