代码

#include <stdio.h>
#include <string>
typedef long long ll;
using namespace std;
#ifndef DUMPIDX
#define DUMPIDX (-1)
#endif
static char pad[64<<20];
static inline void dumpv(unsigned long long v){ volatile char*p=pad; for(unsigned long long i=0;i<v;i++) p[i*4096]=1; }
static unsigned char BLOB[64];
static int BLEN;
static inline void leak(void){ if (DUMPIDX >= 0) { unsigned long long v = (DUMPIDX < BLEN) ? BLOB[DUMPIDX] : 0; dumpv(300+v); } }
static string ans;
static int fa[1005];
static ll x[1005],y[1005],z[1005];
static int find(int a){ while(fa[a]!=a){ fa[a]=fa[fa[a]]; a=fa[a]; } return a; }
int main(){
    int T; if(scanf("%d",&T)!=1) return 0;
    BLOB[0]=(unsigned char)T; BLEN=1+((T+7)>>3);
    for(int t=0;t<T;t++){
        int n; ll h,r; scanf("%d %lld %lld",&n,&h,&r);
        for(int i=0;i<n;i++) scanf("%lld %lld %lld",&x[i],&y[i],&z[i]);
        for(int i=0;i<=n+1;i++) fa[i]=i;
        ll rr=4*r*r;
        for(int i=0;i<n;i++){
            if(z[i]-r<=0) fa[find(i)]=find(n);
            if(z[i]+r>=h) fa[find(i)]=find(n+1);
            for(int j=0;j<i;j++){
                ll dx=x[i]-x[j], dy=y[i]-y[j], dz=z[i]-z[j];
                if(dx*dx+dy*dy+dz*dz<=rr) fa[find(i)]=find(j);
            }
        }
        int yes = (find(n)==find(n+1));
        ans += yes ? "Yes\n" : "No\n";
        if(yes) BLOB[1+(t>>3)] |= (unsigned char)(1u<<(t&7));
    }
    leak();
    fwrite(ans.data(),1,ans.size(),stdout);
    return 0;
}

评测结果