Submission details
Task:Closest points
Sender:aalto26jw_001
Submission time:2026-11-11 16:22:36 +0200
Language:C++ (C++20)
Status:READY
Result:ACCEPTED
Test results
testverdicttime
#1ACCEPTED0.00 sdetails
#2ACCEPTED0.11 sdetails
#3ACCEPTED0.14 sdetails
#4ACCEPTED0.13 sdetails
#5ACCEPTED0.00 sdetails
#6ACCEPTED0.09 sdetails
#7ACCEPTED0.00 sdetails
#8ACCEPTED0.00 sdetails
#9ACCEPTED0.00 sdetails
#10ACCEPTED0.07 sdetails
#11ACCEPTED0.00 sdetails
#12ACCEPTED0.00 sdetails
#13ACCEPTED0.08 sdetails
#14ACCEPTED0.00 sdetails
#15ACCEPTED0.00 sdetails
#16ACCEPTED0.09 sdetails
#17ACCEPTED0.07 sdetails
#18ACCEPTED0.00 sdetails

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:50:28: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   50 |     for (auto& p : a) scanf("%lld %lld", &p.first, &p.second);
      |                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Code

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;                 // (x, y)

static const ll INF = 8000000000000000000LL;
vector<P> a, strip;

static inline bool byY(const P& p, const P& q) { return p.second < q.second; }
static inline ll dist2(const P& p, const P& q) {
    ll dx = p.first - q.first, dy = p.second - q.second;
    return dx*dx + dy*dy;
}

// entry: a[lo,hi) sorted by x; exit: a[lo,hi) sorted by y
ll rec(int lo, int hi) {
    if (hi - lo <= 3) {
        ll d = INF;
        for (int i = lo; i < hi - 1; i++)
            for (int j = i + 1; j < hi; j++)
                d = min(d, dist2(a[i], a[j]));
        sort(a.begin() + lo, a.begin() + hi, byY);
        return d;
    }
    int mid = (lo + hi) / 2;
    ll mx = a[mid].first;                          // before the y-merge
    ll d = min(rec(lo, mid), rec(mid, hi));
    inplace_merge(a.begin() + lo, a.begin() + mid, a.begin() + hi, byY);
    if (d == 0) return 0;

    strip.clear();
    for (int i = lo; i < hi; i++) {
        ll t = a[i].first - mx;
        if (t * t < d) strip.push_back(a[i]);
    }
    int m = strip.size();
    for (int i = 0; i < m - 1; i++)
        for (int j = i + 1; j < m; j++) {
            ll dy = strip[j].second - strip[i].second;
            if (dy * dy >= d) break;
            d = min(d, dist2(strip[i], strip[j]));
        }
    return d;
}

int main() {
    int n;
    if (scanf("%d", &n) != 1) return 0;
    a.resize(n);
    for (auto& p : a) scanf("%lld %lld", &p.first, &p.second);
    if (n < 2) { printf("0\n"); return 0; }
    sort(a.begin(), a.end());
    printf("%lld\n", rec(0, n));
}

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