P1429 平面最近点对[加强版] 随机化

//#include<bits\stdc++.h>
#include<iostream>
#include<iomanip>
#include<cstdio>
#include<cstring>
#include<string>
#include<ctime>
#include<cmath>
#include<cctype>
#include<cstdlib>
#include<queue>
#include<deque>
#include<stack>
#include<vector>
#include<algorithm>
#include<utility>
#include<bitset>
#include<set>
#include<map>
#define ll long long
#define db double
#define INF 1000000000
#define ldb long double
#define pb push_back
#define put_(x) printf("%d ",x);
#define get(x) x=read()
#define gt(x) scanf("%d",&x)
#define gi(x) scanf("%lf",&x)
#define put(x) printf("%d\n",x)
#define putl(x) printf("%lld\n",x)
#define gc(a) scanf("%s",a+1)
#define rep(p,n,i) for(RE int i=p;i<=n;++i)
#define go(x) for(int i=lin[x],tn=ver[i];i;tn=ver[i=nex[i]])
#define fep(n,p,i) for(RE int i=n;i>=p;--i)
#define vep(p,n,i) for(RE int i=p;i<n;++i)
#define pii pair<int,int>
#define mk make_pair
#define RE register
#define P 1000000007
#define gf(x) scanf("%lf",&x)
#define pf(x) ((x)*(x))
#define uint unsigned long long
#define ui unsigned
#define EPS 1e-8
#define sq sqrt
#define mod 1000000007
#define S second
#define F first
#define pf(x) ((x)*(x))
using namespace std;
char buf[1<<15],*fs,*ft;
inline char getc()
{
    return (fs==ft&&(ft=(fs=buf)+fread(buf,1,1<<15,stdin),fs==ft))?0:*fs++;
}
inline int read()
{
    RE int x=0,f=1;RE char ch=getc();
    while(ch<‘0‘||ch>‘9‘){if(ch==‘-‘)f=-1;ch=getc();}
    while(ch>=‘0‘&&ch<=‘9‘){x=x*10+ch-‘0‘;ch=getc();}
    return x*f;
}
const int MAXN=200010;
const db Pi=acos(-1.0);
int n,m;db ans=1e10;
struct wy{db x,y;}t[MAXN];
inline int cmp(wy a,wy b){return a.x<b.x;}
inline db dis(wy a,wy b){return sqrt(pf(a.x-b.x)+pf(a.y-b.y));}
inline void around(db d)
{
	d=d/180*Pi;
	rep(1,n,i)
	{
		db x=t[i].x,y=t[i].y;
		t[i].x=x*cos(d)-y*sin(d);
		t[i].y=x*sin(d)+y*cos(d);
	}
	sort(t+1,t+1+n,cmp);
	rep(1,n,i)
		for(int j=i+1;j<=i+5&&j<=n;++j)
			ans=min(ans,dis(t[i],t[j]));
}
int main()
{
	freopen("1.in","r",stdin);
	srand(time(0));
	get(n);
	rep(1,n,i){int get(x);t[i]=(wy){x,read()};}
	around(0);around(rand()%360);printf("%.4lf",ans);
	return 0;
}