代码

#include<bits/stdc++.h>
using namespace std;
long long t,n,r,h;
long long vis[500001];
bool pd;
struct hole{
    double x,y,z;
}q[50001];
bool check_dist(hole a,hole b) {
    long long dis=(a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y)+(a.z-b.z)*(a.z-b.z);
    if(dis<=4*r*r) 
		return true;
    else 
		return false;
}
void dfs(int k){
    if(pd||q[k].z+r>=h){
    	pd=1;
    	return;
	}
	for(int i=1;i<=n;i++){
		if(vis[i])
			continue;
		if(check_dist(q[k],q[i]))
			vis[i]=1,dfs(i);
	}
}
int main(){
    cin>>t;
    while(t--){
    	memset(vis,0,sizeof(vis));
        cin>>n>>h>>r;
        pd=0;
        for(int i=1;i<=n;i++)
            cin>>q[i].x>>q[i].y>>q[i].z;
        for(int i=1;i<=n;i++)
        	if(q[i].z<=r)
        		vis[i]=1,dfs(i);
		if(pd)
				cout<<"Yes"<<endl;
        	else
			 	cout<<"No"<<endl;
    }
    return 0;
}

评测结果