题目:题目链接
题意:求一群点当中的最近的两个点
分析:分治法,直接把点分成两部分,分别计算最近点对,在合并,模版
代码:
#include <iostream>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <cmath>
#include <ctime>
#define MAX 2000000000
#define LOCA
using namespace std;
struct node
{
double x;
double y;
int id;
}p[200005],p1[100005],p2[100005];
bool cmp(node x, node y)
{
return x.x < y.x;
}
double dist(node x, node y)
{
if(x.id != y.id)
return sqrt((x.x - y.x) * (x.x - y.x) + (x.y - y.y) * (x.y - y.y));
else return 2100000000.0;
}
double Closed(int low, int high)
{
if(high == low)
return 2100000000.0;
if(high - low == 1)
return dist(p[low], p[high]);
int mid = (low + high) / 2;
double d1 = Closed(low, mid);
double d2 = Closed(mid + 1, high);
double d = min(d1, d2);
int i, j, cnt1 = 0, cnt2 = 0;
for(i = mid; i >= low; i--)
{
if(p[mid].x - p[i].x < d)
{
p1[cnt1++] = p[i];
}
}
for(i = mid + 1; i <= high; i++)
{
if(p[i].x - p[mid].x < d)
{
p2[cnt2++] = p[i];
}
}
for(i = 0; i < cnt1; i++)
{
for(j = 0; j < cnt2; j++)
{
d = min(d, dist(p1[i], p2[j]));
}
}
return d;
}
int main()
{
int t, n, i, j;
scanf("%d", &t);
while(t--)
{
scanf("%d", &n);
for(i = 0; i < n; i++)
{
scanf("%lf%lf", &p[i].x, &p[i].y);
p[i].id = 1;
}
for(i = n; i < 2 * n; i++)
{
scanf("%lf%lf", &p[i].x, &p[i].y);
p[i].id = 2;
}
n = n * 2;
sort(p, p + n, cmp);
printf("%.3f\n", Closed(0, n - 1));
}
return 0;
}