POJ 2236【并查集】Wireless Network

Wireless Network

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
题意：
给你一些点，当前有两种操作，修复和测试。
然后输出测试的结果。
思路：
并查集的简单应用，对每次修好的电脑对其它已经修好的电脑遍历，
如果距离小于等于最大通信距离就将他们合并。之后判断2台电脑是不是一个集合中就KO了

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int father[1005];
struct node
{
    int x,y;//坐标
    bool fix;//是否被修复
}s[1005];
int getf(int v)
{
    if(v==father[v])
        return v;
    return father[v]=getf(father[v]);
}
void merge(int v,int u)
{
    int t1=getf(v);
    int t2=getf(u);
    if(t1!=t2)//判断是否为同一个祖先
        father[t2]=t1;
}
int main()
{
    int n,m,i,j;
    cin>>n>>m;
    for(i=1;i<=n;i++)
    {
        cin>>s[i].x>>s[i].y;
        father[i]=i;//初始化
    }
    char a[3];
    while(scanf("%s",a)!=EOF)
    {

        if(a[0]=='O')
        {
            int t;
            cin>>t;
            s[t].fix=true;//被修复
            for(j=1;j<=n;j++)
            {
                if(j==t) continue;
                int distance=(s[t].x-s[j].x)*(s[t].x-s[j].x)+(s[t].y-s[j].y)*(s[t].y-s[j].y);
                //遍历所有电脑
                if(s[j].fix==true&&distance<=m*m)//判断电脑是否被修复，距离小于等于可以直接通信的最大距离
                    merge(t,j);
            }
        }
        else
        {
            int a,b;
            cin>>a>>b;
            if(getf(a)==getf(b)) cout<<"SUCCESS"<<endl;
            else
                cout<<"FAIL"<<endl;
        }
}
return 0;
}