poj-2236 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

这道题目有两种操作，
第一种就是修复其中一台电脑；
另一种是指询问两台电脑是否连接。输入结果为FAIL或者SUCCESS。
这道题目是用并查集写的，因为还有一个距离d的限制，在修好电脑后还需要再判断一下能连接的电脑之间的距离。

代码如下：

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
#define inf 0x3f3f3f3f
int book[1010];
int a[1010],b[1010],vis[1010];
int mind(int x)
{
	if(book[x]==x)
	return x;
	else
	return book[x]=mind(book[x]);
}
void unions(int x,int y)
{
	int dx=mind(x);
	int dy=mind(y);
	if(dx!=dy)
	book[dy]=dx;
}
int main()
{
	int n,d;
	scanf("%d %d",&n,&d);
	for(int i=1;i<=n;i++)
	{
		book[i]=i;
		vis[i]=0;
		scanf("%d %d",&a[i],&b[i]);
	}
	char s[2];
	while(~scanf("%s",s))
	{
		if(s[0]=='S')
		{
			int x,y;
			scanf("%d %d",&x,&y);
			int dx=mind(x);
			int dy=mind(y);
			if(dx==dy)
				printf("SUCCESS\n");
			else
				printf("FAIL\n");
		}
		else
		{
			int x;
			scanf("%d",&x);
			vis[x]=1;
			for(int i=1;i<=n;i++)
			{
				if(i!=x&&vis[i]&&(a[i]-a[x])*(a[i]-a[x])+(b[i]-b[x])*(b[i]-b[x])<=d*d)
				//如果两台电脑都被修复好，并且距离小于d
				unions(i,x);//将两台电脑连接
			}
		}
	}
	return 0;
}