Submission details
Task:Closest points
Sender:aalto25k_006
Submission time:2025-11-12 17:13:17 +0200
Language:C++ (C++17)
Status:READY
Result:ACCEPTED
Test results
testverdicttime
#1ACCEPTED0.00 sdetails
#2ACCEPTED0.17 sdetails
#3ACCEPTED0.41 sdetails
#4ACCEPTED0.43 sdetails
#5ACCEPTED0.00 sdetails
#6ACCEPTED0.18 sdetails
#7ACCEPTED0.00 sdetails
#8ACCEPTED0.00 sdetails
#9ACCEPTED0.00 sdetails
#10ACCEPTED0.13 sdetails
#11ACCEPTED0.00 sdetails
#12ACCEPTED0.00 sdetails
#13ACCEPTED0.12 sdetails
#14ACCEPTED0.00 sdetails
#15ACCEPTED0.00 sdetails
#16ACCEPTED0.19 sdetails
#17ACCEPTED0.13 sdetails
#18ACCEPTED0.00 sdetails

Code

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

long long rec_compute(vector<pair<int, int>> &points, int left, int right) {
    if (right-left <= 1) return LLONG_MAX;
    if (right-left == 2) {
        long long dx = points[left].first-points[right-1].first;
        long long dy = points[left].second-points[right-1].second;
        return dx*dx + dy*dy;
    }

    int mid = (left+right) / 2;
    long long minL = rec_compute(points, left, mid);
    long long minR = rec_compute(points, mid, right);
    long long d = min(minL, minR);

    vector<pair<int, int>> close;
    for (int i = left; i < right; i++) {
        if (abs(points[i].first-points[mid].first) < d) {
            close.push_back(points[i]);
        }
    }

    sort(close.begin(), close.end(), [](const pair<int, int> &a, const pair<int, int> &b){
        return a.second < b.second;
    });

    long long d_close = d;
    for (size_t i = 0; i < close.size(); i++) {
        for (size_t j = i+1; j < close.size() && j < i+8; j++) {
            if (close[j].second-close[i].second < d_close) {
                long long dx = close[i].first-close[j].first;
                long long dy = close[i].second-close[j].second;
                d_close = min(d_close, dx*dx + dy*dy);
            } else {
                break;
            }
        }
    }

    return min(d, d_close);
}

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

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

    cout << rec_compute(points, 0, n);

    return 0;
}

Test details

Test 1

Verdict: ACCEPTED

input
100
58 36
81 -7
46 49
87 -58
...

correct output
1

user output
1

Test 2

Verdict: ACCEPTED

input
200000
-222 -705
277 680
-436 561
528 -516
...

correct output
1

user output
1

Test 3

Verdict: ACCEPTED

input
200000
-464738043 865360844
465231470 129093134
-276549869 -21946314
111055008 -48821736
...

correct output
25413170

user output
25413170

Test 4

Verdict: ACCEPTED

input
200000
1 513001000
2 689002000
3 785003000
4 799004000
...

correct output
1000000

user output
1000000

Test 5

Verdict: ACCEPTED

input
4
0 0
0 3
3 0
1 1

correct output
2

user output
2

Test 6

Verdict: ACCEPTED

input
200000
1 0
1 1
1 2
1 3
...

correct output
1

user output
1

Test 7

Verdict: ACCEPTED

input
4
1 2
10 3
3 5
8 5

correct output
8

user output
8

Test 8

Verdict: ACCEPTED

input
4
10 6
4 10
8 3
2 3

correct output
13

user output
13

Test 9

Verdict: ACCEPTED

input
2
-999999999 -999999999
999999999 999999999

correct output
7999999984000000008

user output
7999999984000000008

Test 10

Verdict: ACCEPTED

input
200000
0 1
1 1
2 1
3 1
...

correct output
1

user output
1

Test 11

Verdict: ACCEPTED

input
8
1 10000
-1 -10000
2 0
-2 0
...

correct output
16

user output
16

Test 12

Verdict: ACCEPTED

input
3
-1000000000 -1000000000
1000000000 1000000000
0 0

correct output
2000000000000000000

user output
2000000000000000000

Test 13

Verdict: ACCEPTED

input
199999
1 1
2 1
3 1
4 1
...

correct output
1

user output
1

Test 14

Verdict: ACCEPTED

input
4
0 0
5 8
6 1
10000 0

correct output
37

user output
37

Test 15

Verdict: ACCEPTED

input
435
-842 -199
-480 798
-176 -406
792 608
...

correct output
2

user output
2

Test 16

Verdict: ACCEPTED

input
200000
1 0
1 2
1 4
1 6
...

correct output
4

user output
4

Test 17

Verdict: ACCEPTED

input
200000
0 1
2 1
4 1
6 1
...

correct output
4

user output
4

Test 18

Verdict: ACCEPTED

input
3
-1000000000 -1000000000
1000000000 1000000000
1000000000 -1000000000

correct output
4000000000000000000

user output
4000000000000000000