poj2236 wireless network(并查集)

每次修好一台，暴力O(n)扫一遍，把能和他直接通讯的合并起来。复杂度O(nm)吧

#include<cstdio>
#include<cstring>
#include<cmath>
#define N 1010
inline int read(){
    int x=0,f=1;char 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;
}
int fa[N],n,d;
struct computers{
    int x,y;
    bool flag;
}c[N];
char s[1];
inline int find(int x){
    return x==fa[x]?x:fa[x]=find(fa[x]);
}
inline void merge(int x,int y){
    int xx=find(x),yy=find(y);
    if(xx!=yy) fa[yy]=xx;
}
int main(){
//  freopen("a.in","r",stdin);
    n=read();d=read();
    for(int i=1;i<=n;++i) fa[i]=i;
    for(int i=1;i<=n;++i)
        c[i].x=read(),c[i].y=read(),c[i].flag=0;
    while(scanf("%s",s)!=EOF){
        if(s[0]=='O'){
            int x=read();c[x].flag=1;
            for(int i=1;i<=n;++i)
                if(c[i].flag&&pow(c[i].x-c[x].x,2)+pow(c[i].y-c[x].y,2)<=d*d) merge(x,i);
        }
        if(s[0]=='S'){
            int x=read(),y=read();
            if(find(x)==find(y)) puts("SUCCESS");
            else puts("FAIL");
        }
    }
    return 0;
}