P3958 蒟蒻90分求助

#pragma GCC optimize(3)
#include<iostream>
#include<fstream>
#include<cstdio>
using namespace std;
long long t,n,h,r,x[10001],y[10001],z[10001],p[1001][1001],f[10001];
int main(){
	cin>>t;
	for(long long i=1;i<=t;i++){
		cin>>n>>h>>r;
		long long c=0;
		for(long long j=1;j<=n;j++){
			cin>>x[j]>>y[j]>>z[j];
			if(z[j]<=r&&z[j]+r>=h){
				c=1;break;
			}
			if(z[j]<=r) p[i][j]=1;
			if(z[j]+r>=h) p[i][j]=2;
		}
		if(c==1) {
			f[i]=1;continue;
		}
		for(long long j=1;j<=n;j++){
			for(long long k=1;k<=n;k++){
				if((x[j]-x[k])*(x[j]-x[k])+(y[j]-y[k])*(y[j]-y[k])+(z[j]-z[k])*(z[j]-z[k])<=4*r*r){
					if((p[i][j]==1&&p[i][k]==2)||(p[i][j]==2&&p[i][k]==1)){
						c=1;break;
					} 
					if((p[i][j]==1&&p[i][k]==1)||(p[i][j]==2&&p[i][k]==2)) continue;
					if(p[i][j]==1) p[i][k]=1;
					if(p[i][k]==1) p[i][j]=1;
					if(p[i][j]==2) p[i][k]=2;
					if(p[i][k]==2) p[i][j]=2;
				}
			}
			if(c==1) break;
		}
		if(c==1) f[i]=1;
	}
	for(long long i=1;i<=t;i++) 
	if(f[i]==1) printf("Yes\n");
	else printf("No\n");
	return 0;
}