POJ 2236 Wireless Network

Description

Input

Output

Sample Input

4 1
0 1
0 2
0 3
0 4
O 1
O 2
O 4
S 1 4
O 3
S 1 4

Sample Output

FAIL
SUCCESS

Source

哇 ，自己做并查集。一次ac。。

#include <iostream>
#include <cstring>
#define maxn 1005
using namespace std;
struct point
{
    int mast;
    int x,y;
}f[maxn];
int find(int x)
{
    if(f[x].mast==x)
        return x;
    else
        return (f[x].mast=find(f[x].mast));
}
int main()
{
    int n,d;
    cin>>n>>d;

    int i;
    for(i=1;i<=n;i++)
    {
        cin>>f[i].x>>f[i].y;
        f[i].mast=i;
    }

    char s;
    bool pd[maxn];
    memset(pd,0,sizeof(pd));

    while(cin>>s)
    {
        if(s==‘S‘)
        {
            int x,y;
            cin>>x>>y;

            if(find(x)==find(y))
                cout<<"SUCCESS"<<endl;
            else
                cout<<"FAIL"<<endl;
        }

        if(s==‘O‘)
        {
           int x;
           cin>>x;

           pd[x]=1;

           for(i=1;i<=n;i++)
           {
               if(pd[i]==1&&i!=x)
               {
                   if((f[i].x-f[x].x)*(f[i].x-f[x].x)+(f[i].y-f[x].y)*(f[i].y-f[x].y)<=d*d)
                   {
                       int a,b;
                       a=find(i);
                       b=find(x);
                       if(a!=b)
                        f[a].mast=b;
                   }
               }
           }
        }
    }
    return 0;
}