P3958 奶酪

这题我提交了十几遍啊。。终于对了啊。。

反正就是最后几个在统计根的时候要用find统计，不用的话会wa掉两个点

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<queue>
#include<stack>
#include<deque>
#include<algorithm>
#define ll long long
using namespace std;
const int oo=0x3f3f3f3f;
const int N=100005;

ll T,n,h,r;
ll x[N],y[N],z[N],fa[N];
struct node{
    ll Min,Max;
}ans[N];

ll get(){
    char zy=getchar();
    ll z=1,y=0;
    while(zy>'9'||zy<'0'){
        if(zy=='-') z=-1;
        zy=getchar();
    }
    while(zy>='0'&&zy<='9'){
        y=(y<<1)+(y<<3)+zy-'0';
        zy=getchar();
    }
    return z*y;
}

ll find(ll x){
    if(fa[x]==x) return x;
    return fa[x]=find(fa[x]);
}

ll dist(ll i,ll j){
    return (x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j])+(z[i]-z[j])*(z[i]-z[j]);
}

int main(){
    T=get();
    while(T--){
        n=get();h=get();r=get();
        for(ll i=1;i<=n;i++){
            x[i]=get();y[i]=get();z[i]=get();
            fa[i]=i;
            ans[i].Min=z[i]-r;
            ans[i].Max=z[i]+r;
        }
        for(ll i=2;i<=n;i++){
            for(ll j=i-1;j>=1;j--){
                if(dist(i,j)<=4*r*r){
                    fa[find(i)]=find(j);
                }
            }
        }
        for(ll i=1;i<=n;i++){
            ans[fa[find(i)]].Min=min(ans[fa[find(i)]].Min,z[i]-r);
            ans[fa[find(i)]].Max=max(ans[fa[find(i)]].Max,z[i]+r);
        }
        bool ok=false;
        for(ll i=1;i<=n;i++){
            if(ans[fa[find(i)]].Max>=h&&ans[fa[find(i)]].Min<=0){
                ok=true;
                break;
            }
            //printf("%lld %lld %lld %lld
",fa[i],ans[fa[i]].Max,h,ans[fa[i]].Min);
        }
        if(ok) printf("Yes
");
        else printf("No
");
    }
    return 0;
}