屎山代码，WA on #1 #2 #4，望大佬条。小号玄 $\infty$ 关。

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define y1 y_1
int read(){int x=0;char f=1,ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar();return x*f;}
const int N=1e6+10;
int n,h,r,fa[N],x[N],y[N],z[N],f1[N],f2[N];
void _init(){
	for(int i=1;i<=n;++i)
		fa[i]=i;
	return;
}
int _find(int x){
	if(x==fa[x])
		return x;
	fa[x]=_find(fa[x]);
	return fa[x];
}
void _merge(int x,int y){
	int fx=_find(x),fy=_find(y);
	if(fx!=fy)
		fa[fx]=fy;
	return;
}
int dis(int x1,int x2,int y1,int y2,int z1,int z2){
	return (x1-x2)*(x1-x2)+(y1-y2)*(y1-y2)+(z1-z2)*(z1-z2);
}
void solve(){
	n=read(),h=read(),r=read();
	_init();
	int cnt1=0,cnt2=0;
	for(int i=1;i<=n;++i){
		x[i]=read(),y[i]=read(),z[i]=read();
		if(z[i]>=h-r)
			f1[++cnt1]=i;
		else if(z[i]<=r)
			f2[++cnt2]=i;
		for(int j=1;j<=i;++j){
			if(dis(x[i],x[j],y[i],y[j],z[i],z[j])>4*r*r)
				continue;
			int temp_1=_find(i),temp_2=_find(j);
			if(temp_1!=temp_2)
				_merge(temp_1,temp_2);
		}
	}
	bool flag=false;
	for(int i=1;i<=cnt1;++i){
		for(int j=1;j<=cnt2;++j)
			if(_find(f1[i])==_find(f2[j])){
				flag=true;
				break;
			}
		if(flag)
			break;
	}
	printf(flag?"Yes\n":"No\n");
	return;
}
signed main(){
	short T=read();
	while(T--)
		solve();
	return 0;
}

Hack input:

5
1 100 60
70 27 88
1 100 75
80 39 34
1 100 50
605 563 50
1 200 160
120 176 40
1 200 10
50 47 84

Ans Output:

No
Yes
Yes
Yes
No

My Output:

No
No
No
No
No