是t了还是wa了
by wangruixiang @ 2019-09-17 16:03:58
```
#include<iostream>
using namespace std;
long long x[1006],y[1006],z[1006];
int fa[1006];
int t,n;
long long h,r;
int find(int x)
{
if(fa[x]==x)return x;
return fa[x]=find(fa[x]);
}
void unionn(int x,int y)
{
x=find(x);y=find(y);
if(x!=y)fa[x]=y;
}
void put(int a,int b)
{
long long q=(x[a]-x[b])*(x[a]-x[b])+(y[a]-y[b])*(y[a]-y[b])+(z[a]-z[b])*(z[a]-z[b]);
long long R=r*r*4LL;
if(q<=R)unionn(a,b);
}
void search(int a,int b)
{
a=find(a);b=find(b);
if(a==b)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
int main()
{
cin>>t;
for(int i=1;i<=t;i++)
{
cin>>n>>h>>r;
for(int j=0;j<=1001;j++)fa[j]=j;
for(int j=1;j<=n;j++)
{
cin>>x[j]>>y[j]>>z[j];
if(z[j]-r<=0)unionn(0,j);
if(z[j]+r>=h)unionn(j,1001);
for(int k=1;k<=j-1;k++)
{
put(j,k);
}
}
search(0,1001);
}
return 0;
}
```
by wangruixiang @ 2019-09-17 16:08:24
好像是没啥毛病
by wangruixiang @ 2019-09-17 16:08:54