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

两台正常电脑直接连接信号需在d距离内。对已坏电脑有两种操作，O表示修理，S表示问怕，p，q能不能传递信号
需标记下修好的电脑。
代码：

#include<cstdio>
#include<cstring>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<queue>

using namespace std;
int n,d,q,p;
int x[1005];//坐标
int y[1005];
int b[1005];//标记
int father[1005];
int ww(int m1,int m2,int w1,int w2)
{
   return (m1-w1)*(m1-w1)+(m2-w2)*(m2-w2);
}
void intl()
{
  for(int i=1;i<=n;i++)
  father[i]=i;
}
int find(int x)
{
if(x!=father[x])
    father[x]=find(father[x]);
return father[x];

}
void combine(int x,int y)
{
    int nx=find(x);
    int ny=find(y);
    if(nx!=ny)
    father[nx]=ny;
}
int main()
{
    scanf("%d%d",&n,&d);
        char s1[2];
        memset(father,0,sizeof(father));
        memset(b,0,sizeof(b));
        intl();
        for(int i=1;i<=n;i++)
        scanf("%d%d",&x[i],&y[i]);
        while(scanf("%s %d",s1,&p)!=EOF)
        {
         if(s1[0]=='O')
          {
            b[p]=1;
            for(int i=1;i<=n;i++)
            if(ww(x[i],y[i],x[p],y[p])<=d*d&&b[i]==1)
            combine(p,i);
          }
          else
          {
            scanf("%d",&q);
            if(find(p)==find(q))
            printf("SUCCESS\n");
            else
            printf("FAIL\n");
          }
       }
}

重点内容
1.这是朴素查找的代码,适合数据量不大的情况：

int findx(int x)
{
int r=x;
while(parent[r] !=r)
r=parent[r];
return r;
}

下面是采用路径压缩的方法查找元素：

int find(int x) //查找x元素所在的集合,回溯时压缩路径
{
if (x != parent[x])
{
parent[x] = find(parent[x]); //回溯时的压缩路径
} //从x结点搜索到祖先结点所经过的结点都指向该祖先结点
return parent[x];
}
2.合并事合并根节点