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

题意：
n台电脑，若两台电脑已维修，并且距离<=d，之间可以直接通讯，也可以通过其他电脑间接通讯。
输入n,d,
n台电脑坐标，操作：
O a表示修理电脑a
S a,b表示测试a,b,之间能否通讯
思路：
计算i，j距离。
flag[a]=1，表示a电脑修过，遍历，若修过且两电脑距离<=d，合并a，i。
S a，b 若a和b的根节点相同，SUCCESS

代码：
#include<stdio.h>
#include<string.h>
#include<math.h>
#include
using namespace std;
int f[11000],book[11000][11000],flag[11000],n,d;//book记录距离是否可以通信,flag记录是否维修这个电脑
void init()
{
int i;
for(i=1;i<=n;i++)
f[i]=i;
return;
}
int getf(int v)
{
if(f[v]==v)
return v;
else
return f[v]=getf(f[v]);
}
void merge(int v,int u)
{
int t1,t2;
t1=getf(v);
t2=getf(u);
if(t1!=t2)
f[t2]=t1;
return;
}
int main()
{
int r,s,x[11000],y[11000];
char c;
while(~scanf("%d%d",&n,&d))
{
init();

    for(int i=1;i<=n;i++)
        scanf("%d%d",&x[i],&y[i]);
    for(int i=1;i<=n;i++)
    {
        for(int j=i;j<=n;j++)
            if((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j])<=d*d)
            book[i][j]=book[j][i]=1;//距离在d以内,标记

    }
    while(~scanf("%c",&c))
    {
        if(c=='O')
        {
            scanf("%d",&r);
            flag[r]=1;
            for(int i=1;i<=n;i++)
                if(flag[i]&&book[r][i])//如果这个电脑被修过，且两台电脑之间距离小于d
                merge(r,i);
        }
        if(c=='S')
        {
            scanf("%d%d",&r,&s);
            if(getf(r)==getf(s))//根节点相同
                printf("SUCCESS\n");
            else
                printf("FAIL\n");
        }
    }
}
return 0;

}