CSES - Aalto Competitive Programming 2024 - wk10 - Wed - Results
Submission details
Task:Closest points
Sender:aalto2024k_004
Submission time:2024-11-13 17:11:20 +0200
Language:C++ (C++17)
Status:READY
Result:ACCEPTED
Test results
testverdicttime
#1ACCEPTED0.00 sdetails
#2ACCEPTED0.16 sdetails
#3ACCEPTED0.24 sdetails
#4ACCEPTED0.27 sdetails
#5ACCEPTED0.00 sdetails
#6ACCEPTED0.26 sdetails
#7ACCEPTED0.00 sdetails
#8ACCEPTED0.00 sdetails
#9ACCEPTED0.00 sdetails
#10ACCEPTED0.13 sdetails
#11ACCEPTED0.00 sdetails
#12ACCEPTED0.00 sdetails
#13ACCEPTED0.13 sdetails
#14ACCEPTED0.01 sdetails
#15ACCEPTED0.00 sdetails
#16ACCEPTED0.26 sdetails
#17ACCEPTED0.13 sdetails
#18ACCEPTED0.00 sdetails

Code

#include <float.h>
#include <math.h>
#include <stdlib.h>

#include <algorithm>
#include <climits>
#include <iomanip>
#include <iostream>
#include <set>
#include <vector>
using namespace std;

#define ll long long int

struct Point {
    ll x, y;
};

bool compareX(const Point& p1, const Point& p2) {
    return (p1.x != p2.x) ? (p1.x - p2.x) : (p1.y - p2.y);
}

long long
closestPair(vector<pair<long long, long long> > coordinates,
            int n) {
    sort(coordinates.begin(), coordinates.end());

    set<pair<long long, long long> > s;

    long long squaredDistance = LLONG_MAX;
    long long j = 0;

    for (long long i = 0; i < n; ++i) {
        long long D = ceil(sqrt(squaredDistance));
        while (coordinates[i].first - coordinates[j].first >= D) {
            s.erase({coordinates[j].second, coordinates[j].first});
            j += 1;
        }

        auto start = s.lower_bound({coordinates[i].second - D,
                                    coordinates[i].first});
        auto end = s.upper_bound({coordinates[i].second + D,
                                  coordinates[i].first});

        for (auto it = start; it != end; ++it) {
            long long dx = coordinates[i].first - it->second;
            long long dy = coordinates[i].second - it->first;
            squaredDistance = min(squaredDistance, 1LL * dx * dx + 1LL * dy * dy);
        }

        s.insert({coordinates[i].second,
                  coordinates[i].first});
    }
    return squaredDistance;
}

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

    cout << fixed << closestPair(P, n) << endl;
}

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