KD树模板1

In case of failure

题目大意：

在二维空间给你n个点，求每个点最近的点，求出距离平方

#include <bits/stdc++.h>
//#define inf 0x7fffffff
//#define ll long long
#define int long long
//#define double long double
#define re register int
#define void inline void
#define eps 1e-8
//#define mod 1e9+7
#define ls(p) p<<1
#define rs(p) p<<1|1
#define pi acos(-1.0)
#define pb push_back
#define inf 1e12
#define mk make_pair
//#define P pair < int , int > 
using namespace std;
//const int mod=1e9+7;
const int M=5e6;
const int N=3e5+5;
struct node
{
	int d[2];
	int id;
}e[N],t[N],q;
int v[N],split[N];
int ans,cmp1,n;
bool cmp(node i,node j)
{
	return i.d[cmp1]<j.d[cmp1];
}
int qr(int x)
{
	return x*x;
}
void bulid(int l,int r,int idx)
{
	if(l>r)  return;
	int mid=(l+r)>>1;
	split[mid]=cmp1=idx;
	nth_element(e+l,e+mid,e+r+1,cmp);
	bulid(l,mid-1,idx^1);bulid(mid+1,r,idx^1);
}
void ask(int l,int r)
{
	if(l>r)  return;
	int mid=(l+r)>>1;
	if(!v[e[mid].id])
	{
		int dis=0;
		for(re i=0;i<2;i++)  dis+=qr(q.d[i]-e[mid].d[i]);
		ans=min(ans,dis);
	}
	int idx=split[mid];
	int ra=qr(q.d[idx]-e[mid].d[idx]);
	if(q.d[idx]<e[mid].d[idx])
	{
		ask(l,mid-1);
		if(ra<ans)  ask(mid+1,r);
	}
	else
	{
		ask(mid+1,r);
		if(ra<ans)  ask(l,mid-1);
	}
}
void solve() 
{
	cin>>n;
	for(re i=1;i<=n;i++)  scanf("%lld%lld",&e[i].d[0],&e[i].d[1]),e[i].id=i;
	for(re i=1;i<=n;i++)  t[i]=e[i],v[i]=0;
	bulid(1,n,0);
	for(re i=1;i<=n;i++)
	{
		q=t[i];
		v[i]=1;
		ans=1e18;
		ask(1,n);
		printf("%lld\n",ans);
		v[i]=0;
	}
}
signed main()
{
    int T=1;
    cin>>T;
    for(int index=1;index<=T;index++)
    {
//    	printf("Case #%d: \n",index);
        solve();
//        puts("");
    }
    return 0;
}
/*
3
2
11
4
1100
7
0132130

*/