题目大意:平面上有n个点,对于删去n个点中的任意一个,算出剩下的点对间的最短距离,输出他们的平方和。
题解:若p1,p2为最近点对,则不删p1或p2时,最短距离就是p1,p2的距离d,贡献为d*d*(n-2);删去p1或p2时求剩下n-1个最短距离,分别求贡献即可。复杂度O(T*n*logn*logn)
而求n个点对的最短距离是个经典的问题。
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <queue>
using namespace std;
typedef long long LL;
const int M=1000000007;
const int N=1e5+10;
const LL INF=1000000000000000000LL;
struct Node {
int x,y;
}a[N],b[N];
int c[N];
int n;
bool cmpx(Node i,Node j){return (i.x<j.x)||(i.x==j.x && i.y<j.y);}
bool cmpy(int i,int j){return (a[i].y<a[j].y)||(a[i].y==a[j].y && a[i].x<a[j].x);}
LL dis(int u,int v){
return (LL)(a[u].x-a[v].x)*(a[u].x-a[v].x)+(LL)(a[u].y-a[v].y)*(a[u].y-a[v].y);
}
LL Find(int L,int R,int&p1,int&p2)
{
if (L>=R)return INF;
if (R-L==1){p1=L,p2=R;return dis(L,R);}
int mid=(L+R)>>1;
LL d=Find(L,mid,p1,p2);
int pp1,pp2;LL d2=Find(mid+1,R,pp1,pp2);
if (d2<d){d=d2;p1=pp1;p2=pp2;}
//mid;
int m=0;
for (int i=L;i<=R;i++)if (abs(a[i].x-a[mid].x)<d)c[m++]=i;
sort(c,c+m,cmpy);
for (int i=0;i<m;i++)for (int j=i+1;j<m && a[c[j]].y-a[c[i]].y<d;j++)if (dis(c[i],c[j])<d){
d=dis(c[i],c[j]);p1=c[i];p2=c[j];
}
return d;
}
void work()
{
scanf("%d",&n);
for (int i=0;i<n;i++)scanf("%d%d",&a[i].x,&a[i].y);
sort(a,a+n,cmpx);
int p1,p2;
LL d=Find(0,n-1,p1,p2);
LL Ans=d*(n-2);
Node tmp;int p3,p4;
for (int i=0;i<n;i++)b[i]=a[i];
tmp=a[p1];a[p1]=a[n-1];a[n-1]=tmp;//swap(a[p1,n-1);
sort(a,a+n-1,cmpx);
Ans+=Find(0,n-2,p3,p4);
for (int i=0;i<n;i++)a[i]=b[i];
tmp=a[p2];a[p2]=a[n-1];a[n-1]=tmp;//swap(p2,n-1);
sort(a,a+n-1,cmpx);
Ans+=Find(0,n-2,p3,p4);
cout<<Ans<<endl;
}
int main()
{
//freopen("1.txt","r",stdin);
int Case;scanf("%d",&Case);
while (Case--)work();
return 0;
}