NOIP2017 奶酪 dfs

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<string>
#include<vector>
#include<string.h>
#include<map>
#include<cmath>
#include<set>
#define ll long long
#define maxn 1000001
#define ull unsigned long long
using namespace std;

int t,n,flag=0,v[1005];
ll x[1005],y[1005],z[1005],h,r;
double dis(int a,int b){
    double x1=x[a],y1=y[a],z1=z[a],x2=x[b],y2=y[b],z2=z[b];
    return sqrt((double)(x1-x2)*(x1-x2)+(double)(y1-y2)*(y1-y2)+(double)(z1-z2)*(z1-z2));
}
void find(int k){
    if(z[k]+r>=h) {flag=1;return;}
    v[k]=1;
    for(int i=1;i<=n;i++){
        if(!v[i]&&dis(k,i)<=2.0*r) find(i);
    }
}
int main(){
    ios::sync_with_stdio(false);
    cin>>t;
    for(int i=1;i<=t;i++){
        memset(x,-1,sizeof x); memset(y,-1,sizeof y);
        memset(z,-1,sizeof z); memset(v,0,sizeof v);
        cin>>n>>h>>r;
        for(int i=1;i<=n;i++)
            cin>>x[i]>>y[i]>>z[i];
        for(int i=1;i<=n;i++){
            if(!v[i]&&z[i]-r<=0) find(i);
            if(flag==1){ cout<<"Yes"<<endl; break;}
        }
        if(flag==0) cout<<"No"<<endl;
        flag=0;
    }
    return 0;
}