Vanilla_chan @ 2021-02-23 11:06:51
就还差一亿点点啦！玄学RE，谢谢大佬！
```
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<queue>
#include<vector>
#include<limits.h>
#define IL inline
#define re register
#define LL long long
#define ULL unsigned long long
#ifdef TH
#define debug printf("Now is %d\n",__LINE__);
#else
#define debug
#endif
using namespace std;
int n;
struct Point
{
double x,y;
IL bool operator<(const Point& z)const
{
return x==z.x?y<z.y:x<z.x;
}
}point[2100010];
int top;
int stac[2100010];
double dis(int x,int y)
{
return sqrt(fabs((point[x].x-point[y].x)*(point[x].x-point[y].x)+(point[x].y-point[y].y)*(point[x].y-point[y].y)));
}
IL bool cmp(const int& x,const int&y)
{
return point[stac[x]].y<point[stac[y]].y;
}
double solve(int l,int r)
{
// debug cout<<"l="<<l<<" r="<<r<<endl;
if(l+1==r)
{
return dis(l,r);
}
if(l+2==r)
{
return min(min(dis(l,l+1),dis(l,l+2)),dis(l+1,l+2));
}
if(l==r) return 1e5;
int mid=(l+r)/2;
double delta=min(solve(l,mid),solve(mid+1,r));
top=0;
for(int i=l;i<=r;i++)
{
if(point[i].x<=point[mid].x+delta&&point[i].x>=point[mid].x-delta) stac[++top]=i;
}
if(!top) return delta;
sort(stac+1,stac+top+1,cmp);
for(int i=1;i<=top;i++)
{
for(int j=i+1;j<=top;j++)
{
if(point[stac[j]].y-point[stac[i]].y>delta) break;
delta=min(delta,dis(stac[i],stac[j]));
}
}
return delta;
}
int main()
{
// freopen("P1429_8.in","r",stdin);
cin>>n;
// cout<<"n="<<n<<endl;
for(int i=1;i<=n;i++) cin>>point[i].x>>point[i].y;
sort(point+1,point+n+1);
printf("%.4lf",solve(1,n));
return 0;
}
```
下载了数据，感觉数据挺普通的啊（除了第一行有个空行之外）
by Vanilla_chan @ 2021-02-23 12:45:07
找到了，
stac中存的是在2d范围内的点的下标，但是在再按照y来排序的sort的cmp中，比较写成了
return point[stac[x]].y<point[stac[y]].y;
应为
return point[x].y<point[y].y;
果然，数据水了，什么AC人都有……
-EOF-