1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
| #include <bits/stdc++.h>
#pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#define MAX_N 505
#define INF 987654321
#define ll long long
#define pll pair<ll, ll>
#define vpll vector<pll>
#define vall3 vector<array<ll,3>>
#define all5 array<ll,5>
#define vall5 vector<all5>
#define vll vector<ll>
#define vs vector<string>
#define usll unordered_set<ll>
#define vvs vector<vs>
#define vvll vector<vll>
#define all(a) begin(a), end(a)
using namespace std;
struct Point {
ll x, y;
};
bool operator < (const Point& me, const Point& other) {
if(me.y == other.y) return me.x < other.x;
return me.y < other.y;
}
vector<Point> p;
ll n;
ll dist(Point& a, Point b) {
return (a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y);
}
ll solve() {
sort(all(p), [](Point& a, Point& b) {
if(a.x == b.x) return a.y < b.y;
return a.x < b.x;
});
set<Point> s;
ll mi = dist(p[0], p[1]);
s.insert(p[0]);
s.insert(p[1]);
for(ll i = 2, j = 0; i < n; i++) {
while(j < i and (p[i].x - p[j].x) * (p[i].x - p[j].x) >= mi) {
s.erase(p[j++]);
}
auto lo = s.lower_bound({INT_MIN, (ll)(p[i].y - sqrt(mi))});
auto hi = s.upper_bound({INT_MAX, (ll)(p[i].y + sqrt(mi))});
for(auto it = lo; it != hi; it++) {
mi = min(mi, dist(p[i], *it));
}
s.insert(p[i]);
}
return mi;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.setf(ios::fixed);
cout.precision(8);
cin>>n;
for(ll i = 0, x, y; i < n; i++) {
cin>>x>>y;
p.push_back({x,y});
}
cout<<solve();
return 0;
}
|
