题意 输入n 给你2n个点 前n和后n 距离最近的点是?
我们用最经典的最近点分治去做 只不过加个id就行了 id区别不同的组别
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
int n;
struct P
{
int id;
double x, y;
bool operator <(const P& B)const { return x < B.x; }
}p[100050*2];
double dis(P A, P B) { if(A.id!=B.id) return (A.x-B.x)*(A.x-B.x) + (A.y-B.y)*(A.y-B.y);else return 3e10+9; }
P Q[100050*2];
double Divide(int l, int r)
{
if(l == r) return 3e10+9;
int mid = (l+r)>>1, tx = p[mid].x, tot = 0;
double d;
d = min(Divide(l, mid), Divide(mid+1, r));
for(int i = l, j = mid+1; (i <= mid || j <= r); i++)
{
while(j <= r && (p[i].y > p[j].y || i >