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
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
#include<cmath>
#include<algorithm>
const int MAX_E=1010;
int vis[MAX_E];
int par[MAX_E];
int fix[MAX_E];//用于记录以及修理好的坐标
//int rankA[MAX_E];//有时候不用到rankA[MAX_E]可以简约使用
struct name{
int x;
int y;
}s[MAX_E];
void init(int n){
for(int i=1;i<=n;i++){
par[i]=i;
}
}
int find(int x){
if(par[x]==x)
return x;
else
return par[x]=find(par[x]);
}
double GetDis(int u,int m){
double x1=s[u].x-s[m].x;
double y1=s[u].y-s[m].y;
return sqrt(x1*x1*1.0+y1*y1*1.0);
}
/*
void unite(int x,int y){
x=find(x);
y=find(y);
if(x==y)
return ;
if(rankA[x]<rankA[y]){
par[x]=y;
}
else{
par[y]=x;
if(rankA[x]==rankA[y])
rankA[x]++;
}
}*/
int main(){
int n,dis;
s[0].x=s[0].y=0;
scanf("%d%d",&n,&dis);
init(n);//不要忘记
for(int i=1;i<=n;i++){
cin>>s[i].x>>s[i].y;//输入坐标
}
char s[2];
int cnt=0,m;
while(scanf("%s",s)!=EOF){
if(s[0]=='O'){//表示修复
cin>>m;
if(vis[m])
continue;
vis[m]=true;
fix[++cnt]=m;//记录坐标
//判断是否连通
for(int i=1;i<cnt;i++){
int u=fix[i];//u与m之间的距离
double dis_=GetDis(u,m);
if(dis_<=(double)dis){
int fx=find(u);
int fy=find(m);
par[fy]=fx;
}
}
}
else{//测试
int a,b;
cin>>a>>b;
if(find(a)==find(b))
cout<<"SUCCESS"<<endl;
else
cout<<"FAIL"<<endl;
}
}
}
/*Sample Input//序号,最大距离---------------坐标 修复操作与测试是否可以通讯
4 1
0 1
0 2
0 30
0 4
O 1
O 2
O 4
S 1 4
O 3
S 1 4
Sample Output
FAIL
SUCCESS*/