Pagini recente » Cod sursa (job #470572) | Cod sursa (job #433593) | Cod sursa (job #101551) | Cod sursa (job #2694266) | Cod sursa (job #2554470)
//Scuzati bulaneala
#include <bits/stdc++.h>
#define debug(x) cerr << #x << " " << x << "\n"
using namespace std;
pair <int,int> v[100001];
double distanta(pair <int,int> n, pair <int,int> m)
{
pair <double,double> a = {n.first,n.second},b = {m.first,m.second};
return sqrt((b.first - a.first) * (b.first - a.first) + (b.second - a.second) * (b.second - a.second));
}
set <pair <int,int> > s;
int main()
{
ifstream cin("cmap.in");
ofstream cout("cmap.out");
ios_base::sync_with_stdio(false);
cin.tie(0);
int n,i;
cin >> n;
for(i = 1; i <= n; i++)
{
cin >> v[i].first >> v[i].second;
//s.insert(v[i]);
}
double minim = (double)(1 << 30);
sort(v + 1,v + n + 1);
int j = 1;
for(i = 1; i <= n; i++)
{
while(v[i].first - v[j].first >= minim * minim)
{
s.erase({v[j].second,v[j].first});
j++;
}
auto it1 = s.lower_bound({v[i].second - minim, v[i].first});
auto it2 = s.upper_bound({v[i].second + minim, v[i].first});
for (auto it = it1; it != it2; ++it)
{
int dx = it->second;
int dy = it->first;
minim = min(minim, distanta({dx,dy},v[i]));
}
s.insert({v[i].second, v[i].first});
}
cout << fixed << setprecision(6) << minim;
return 0;
}