bfs求查错

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

ll t,n,h,r;
ll x[N],y[N],z[N];
ll que[N],top,rear;
bool vis[N];

int read()
{
	int res=0,flg=1;
	char ch=getchar();
	while(ch>'9'||ch<'0'){if(ch=='-') flg=-1;ch=getchar();}
	while(ch<='9'&&ch>='0') res=(res<<3)+(res<<1)+(ch^48),ch=getchar();
	return res*flg;
}
ll pf(int a){return ((ll)a)*((ll)a);
bool dis(int a,int b)
{
	return pf(x[a]-x[b])+pf(y[a]-y[b])+pf(z[a]-z[b])<=4*pf(r);
}
inline bool bfs()
{
	top=rear=0;
	memset(vis,0,sizeof(vis));
	for(int i=1;i<=n;i++)
		if(z[i]-r<=0)
			que[++rear]=i,vis[i]=1;
	while(top<rear)
	{
		int c=que[++top];
		if(z[c]+r>=h) return 1;
		for(int i=1;i<=n;i++)
			if(!vis[i]&&dis(i,c))
				que[++rear]=i;
	}
	return 0;
}

int main(){
//	freopen("testdata.in","r",stdin);//
	
	t=read();
	for(int i=1;i<=t;i++)
	{
		n=read(),h=read(),r=read();
		for(int i=1;i<=n;i++)
			x[i]=read(),y[i]=read(),z[i]=read();
		if(bfs()) puts("Yes");
		else puts("No");
	}
	return 0;
}