Submission details
Task:Closest points
Sender:aalto26jw_004
Submission time:2026-11-11 16:57:47 +0200
Language:C++ (C++23)
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.00 sdetails
#2--details
#3--details
#4--details
#5ACCEPTED0.00 sdetails
#6--details
#7ACCEPTED0.00 sdetails
#8ACCEPTED0.00 sdetails
#90.00 sdetails
#10--details
#11ACCEPTED0.00 sdetails
#12ACCEPTED0.00 sdetails
#13--details
#14ACCEPTED0.00 sdetails
#15ACCEPTED0.00 sdetails
#16--details
#17--details
#18ACCEPTED0.00 sdetails

Code

#include <iostream>
#include <vector>
#include <cmath>

struct Point {
    long long x, y;
};

long long dist(Point a, Point b) {
    return std::pow(a.x - b.x, 2) + std::pow(a.y - b.y, 2);
}


int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(NULL);
    int n;
    std::cin >> n;
    std::vector<Point> points(n);
    for (int i = 0; i < n; i++) {
        std::cin >> points[i].x >> points[i].y;
    }
    long long distmin = __LONG_LONG_MAX__;
    for (int i = 0; i < n - 1; i++) {
        for (int j = i + 1; j < n; j++) {
            long long d = dist(points[i], points[j]);
            if (distmin > d) distmin = d;
        }
    }
    std::cout << distmin << '\n';
}

// import sys

// args = [x for x in sys.stdin.read().strip().split('\n')]
// n = int(args[0])
// args.pop(0)
// points = [[] for _ in range(n)]
// for i in range(n):
//     tmp = args[i].split()
//     points[i].append(int(tmp[0]))
//     points[i].append(int(tmp[-1]))
// distmin = int(((points[0][0] - points[1][0])**2 + (points[0][1] - points[1][1])**2))

// for i in range(n - 1):
//     for j in range(i+1, n):
//         d = int(((points[i][0] - points[j][0])**2 + (points[i][1] - points[j][1])**2))
//         if d < distmin:
//             distmin = d
// print(distmin)

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:

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

correct output
1

user output
(empty)

Test 3

Verdict:

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

correct output
25413170

user output
(empty)

Test 4

Verdict:

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

correct output
1000000

user output
(empty)

Test 5

Verdict: ACCEPTED

input
4
0 0
0 3
3 0
1 1

correct output
2

user output
2

Test 6

Verdict:

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

correct output
1

user output
(empty)

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:

input
2
-999999999 -999999999
999999999 999999999

correct output
7999999984000000008

user output
7999999984000000000

Feedback: Incorrect character on line 1 col 19: expected "79999...00008", got "79999...00000"

Test 10

Verdict:

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

correct output
1

user output
(empty)

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:

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

correct output
1

user output
(empty)

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:

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

correct output
4

user output
(empty)

Test 17

Verdict:

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

correct output
4

user output
(empty)

Test 18

Verdict: ACCEPTED

input
3
-1000000000 -1000000000
1000000000 1000000000
1000000000 -1000000000

correct output
4000000000000000000

user output
4000000000000000000