链接:http://exam.upc.edu.cn/problem.php?cid=1430&pid=27
题意:求两个集合S1,S2中最近两点距离。
思路:
最近点对距离问题,分治法。
将每个集合分为根据 x 坐标分为左右两个子点集,先分别求两边点集中的最短点对距离ans1, ans2,求最短ans = min(ans1, ans2),然后考虑:形成最短点对距离的两点可能分别属于两个子点集的情况,则两点一定在 [point[mid].x - ans,point[min].x+ans]
之间(point[mid].x为中间点的横坐标),更新ans即可。
见:https://blog.csdn.net/lttree/article/details/25156173
代码:
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5+5;
int a[maxn];
struct Node{double x, y; int flag;}node[maxn];
bool cmp1(Node a, Node b){return a.x<b.x;}
bool cmp2(int a, int b){return node[a].y<node[b].y;}
double Distance(Node a, Node b){return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));}
double ShortestDist(int l, int r)
{
if(r-l==1) {
if(node[l].flag!=node[r].flag)
return Distance(node[l], node[r]);
else return 99999999;
}
if(r-l==2) {
if(node[l].flag==node[l+1].flag ){
if(node[l].flag==node[l+2].flag) return 99999999;
else return min(Distance(node[l],node[l+2]),Distance(node[l+1],node[l+2]));
}
else{
if(node[l].flag==node[l+2].flag) return min(Distance(node[l],node[l+1]),Distance(node[l+2],node[l+1]));
else return min( Distance(node[l],node[l+1]),Distance(node[l],node[l+2]));
}
return min(Distance(node[l],node[r]),min(Distance(node[l],node[l+1]),Distance(node[l+1],node[r])));
}
int mid=(l+r)>>1;
double ans = min(ShortestDist(l, mid), ShortestDist(mid+1, r));
int i, j, cnt=0;
for(i=l; i<r; i++)
if(node[i].x>=node[mid].x-ans && node[i].x<=node[mid].x+ans) a[cnt++] = i;
sort(a, a+cnt, cmp2);
for(i=0; i<cnt; i++)
for(j=i+1; j<cnt; j++){
if(node[a[i]].flag != node[a[j]].flag){
if(node[a[j]].y - node[a[i]].y >= ans) break;
ans = min(ans, Distance(node[a[i]], node[a[j]]));
}
}
return ans;
}
int main()
{
int i,t,n; cin >> t;
while(t--) {
scanf("%d",&n);
for(i=0;i<n+n;++i) scanf("%lf%lf",&node[i].x,&node[i].y), node[i].flag=(i<n);
sort(node,node+n+n,cmp1);
printf("%.3lf\n",ShortestDist(0,n+n -1));
}
}