POJ 2236 （并查集）

#include<queue>
#include<algorithm>
#include<cstdio>
#include<iostream>
#include<string.h>
#include<vector>
using namespace std;
const int maxn=1001;
const int INF=0x3f3f3f;
int x[maxn];
int y[maxn];
bool vis[maxn];
int p[maxn];

int Find(int x)
{
    return x==p[x]?x:p[x]=Find(p[x]);
}
int join(int a,int b)
{
    int father1=Find(a),father2=Find(b);
    if(father1!=father2)
    p[father1]=father2;
   return 0;
}

int main()
{

    int n,m;
    memset(vis,0,sizeof vis);
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++)
    {
        scanf("%d%d",&x[i],&y[i]);
    }
    for(int i=0;i<=n;i++)
        p[i]=i;
    char a[10];
    int num;
    while(~scanf("%s",&a))
    {
        if(a[0]=='O')
        {
            scanf("%d",&num);
            vis[num]=1;
            int x1=x[num];
            int y1=y[num];
            vis[num]=1;
            for(int i=1;i<=n;i++)
            {
                if((((x[i]-x1)*(x[i]-x1))+((y[i]-y1)*(y[i]-y1))<=m*m)&&vis[i])
                {
                    join(num,i);
                }

            }
        }
        else
        {
            int a,b;
            scanf("%d%d",&a,&b);
//           cout<<Find(a)<<"    "<<Find(b)<<endl;
            if(Find(a)==Find(b))
                printf("SUCCESS\n");
            else
                printf("FAIL\n");
        }
    }
}