0pts求助悬关

#include <bits/stdc++.h>
#define int long long 
using namespace std;

const int MAXN=1e5+10,MAXM=1e3+10;
int n,h,r,cntd,cntu,totd[MAXN],totu[MAXN],fa[MAXM];
struct node{
    int x,y,z;
}pot[MAXN];

inline int dist(node a,node b){
    return (a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y)+(a.z-b.z)*(a.z-b.z);
}
inline void init(){
    cntd=cntu=0;
    for(int i=0;i<=n;++i) {
        pot[i].x=pot[i].y=pot[i].z=0;
        totd[i]=totu[i]=0;
    }
}
inline int find(int x){
    return fa[x]==x?x:(fa[x]=find(fa[x]));
}

signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0),cout.tie(0);
    int T; cin>>T;
    while(T--){
        init();
        cin>>n>>h>>r;
        for(int i=1;i<=n;++i) fa[i]=i;
        for(int i=1;i<=n;++i) {
            cin>>pot[i].x>>pot[i].y>>pot[i].z;
            if(pot[i].z-r<=0) totd[++cntd]=i;
            if(pot[i].z+r>=h) totu[++cntu]=i;
            for(int j=1;j<=i;++j) {
                if(4*r*r<=(pot[i].x-pot[j].x)*(pot[i].x-pot[j].x)+(pot[i].y-pot[j].y)*(pot[i].y-pot[j].y)) continue;
                if(4*r*r>=dist(pot[i],pot[j])){
                    int fx=find(i),fy=find(j);
                    if(fx!=fy) fa[fx]=fy;
                }
            }
        }
        int flag=0;
        for(int i=1;i<=cntu;++i){
            for(int j=1;j<=cntd;++j)
                if(find(totu[i])==find(totd[j])) {
                    flag=1;
                    break;
                }
            if(flag==1) break;
        }
        if(flag==1) cout<<"YES"<<'\n';
        else cout<<"NO"<<'\n';
    }
    return 0;
}