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

对于联通问题，把连通的点用并查集记录起来；

当一个点打开时（暂时称为打开），可以直接O(n)寻找。

如果一个点u，满足u已经打开，而且u到当前点x的距离<d 那么union(u,x)。

对于距离的判断最好还是都平方一下，避开小数。

坑爹的是单词别拼错了，。。我竟然WA了1遍QAQ因为SUCCESS 打成了SUCCEES。

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#define LL long long
#define rep(i,a,b) for (int i=a;i<=b;i++)
#define per(i,a,b) for (int i=a;i>=b;i--)
#define N 1005
using namespace std;
int n,m,ans,x[N],y[N],fa[N],ha[N];
int d[N][N];
int dis(int x1,int y1,int x2,int y2)
{
 return (x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
}
int gf(int x)
{
 if (fa[x]!=x) fa[x]=gf(fa[x]);
 return fa[x];
}
void unn(int x,int y)
{
 int t1=gf(x),t2=gf(y);
 if (t1!=t2) fa[t2]=t1;
}
int main()
{
 scanf("%d%d",&n,&m);
 ans=0;
 rep(i,1,n) fa[i]=i,ha[i]=0;
 rep(i,1,n)
  scanf("%d%d",&x[i],&y[i]);
 rep(i,1,n)
  rep(j,i+1,n)
   d[i][j]=dis(x[i],y[i],x[j],y[j]),
   d[j][i]=d[i][j];
 char s[1];
 while (~scanf("%s",&s))
 {
  if (s[0]=='S')
  {
   int x,y;
   scanf("%d%d",&x,&y);
   int t1=gf(x),t2=gf(y);
   if (t1==t2) printf("SUCCESS\n");
    else printf("FAIL\n");
  }
  if (s[0]=='O')
  {
   int x;
   scanf("%d",&x);
   ha[x]=1;
   rep(i,1,n)
    if (d[x][i]<=m*m && ha[i]) 
     unn(x,i);
  }
 }
 return 0;
}