poj 2236（并查集）

Wireless Network

Time Limit: 10000MS		Memory Limit: 65536K
Total Submissions: 20929		Accepted: 8795

Description

An earthquake takes place in Southeast Asia. The ACM (Asia Cooperated Medical team) have set up a wireless network with the lap computers, but an unexpected aftershock attacked, all computers in the network were all broken. The computers are repaired one by one, and the network gradually began to work again. Because of the hardware restricts, each computer can only directly communicate with the computers that are not farther than d meters from it. But every computer can be regarded as the intermediary of the communication between two other computers, that is to say computer A and computer B can communicate if computer A and computer B can communicate directly or there is a computer C that can communicate with both A and B. 

In the process of repairing the network, workers can take two kinds of operations at every moment, repairing a computer, or testing if two computers can communicate. Your job is to answer all the testing operations. 

Input

The first line contains two integers N and d (1 <= N <= 1001, 0 <= d <= 20000). Here N is the number of computers, which are numbered from 1 to N, and D is the maximum distance two computers can communicate directly. In the next N lines, each contains two integers xi, yi (0 <= xi, yi <= 10000), which is the coordinate of N computers. From the (N+1)-th line to the end of input, there are operations, which are carried out one by one. Each line contains an operation in one of following two formats: 
1. "O p" (1 <= p <= N), which means repairing computer p. 
2. "S p q" (1 <= p, q <= N), which means testing whether computer p and q can communicate. 

The input will not exceed 300000 lines. 

Output

For each Testing operation, print "SUCCESS" if the two computers can communicate, or "FAIL" if not.

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

思路：并查集的应用，关于并查集我觉得这个博客里转载的这篇文章讲的比较清楚（http://blog.csdn.net/dellaserss/article/details/7724401）我基本就是按照这个框架写的

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int pre[1002],vis[1002];
typedef pair<int,int> node;
node s[1002];

int lookfor(int x)//查找它的根
{
    int r=x;
    while(pre[r]!=r)
        r=pre[r];
    int i=x,j;
    while(i!=r)//路径压缩
    {
        j=pre[i];
        pre[i]=r;
        i=j;
    }
    return r;
}

int main()
{
    int N,d,i,b,c,j,dis,xb,yb,xj,yj;
    memset(vis,0,sizeof(vis));
    memset(pre,0,sizeof(pre));
    scanf("%d%d",&N,&d);
    for(i=1;i<=N;i++)scanf("%d%d",&s[i].first,&s[i].second);
    char a;
    while(scanf("%c",&a)!=EOF)
    {
        if(a=='O')
        {
            scanf("%d",&b);
            pre[b]=b;
            vis[b]=1;
            xb=s[b].first;
            yb=s[b].second;
            for(j=1;j<=N;j++)
            {
                if(vis[j]&&j!=b)
                {
                    xj=s[j].first;
                    yj=s[j].second;
                    dis=(xb-xj)*(xb-xj)+(yb-yj)*(yb-yj);
                    if(dis<=d*d)
                        pre[lookfor(b)]=lookfor(j);
                }
            }
        }
        else if(a=='S')
        {
            scanf("%d%d",&b,&c);
            if(vis[b]==0||vis[c]==0)printf("FAIL\n");//写成FALL了。。WA了几次==
            else if(lookfor(b)==lookfor(c))printf("SUCCESS\n");
            else printf("FAIL\n");
        }
    }
    return 0;
}