Time Limit: 10000MS | Memory Limit: 65536K | |
Total Submissions: 34597 | Accepted: 14337 |
Description
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.
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.
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+编号,表示修复该编号的电脑,输入S+编号表示判断这两
台电脑之间能否联网,联网的条件:两台电脑之间的距离小于d或者中间有其他电脑做链接。
#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cstring>
using namespace std;
//const int MAX_N=100000;
int x[1010],y[1010],pre[10005],vis[1010],n,d;
void init(int n){
for(int i=1;i<=n;i++){
pre[i]=i;//初始化并查集
vis[i]=0;//用来记录该点有没有被修过
}
}
int find(int x){
int r=x;
while(pre[r]!=r){
r=pre[r];
}
int i=x,j;
while(i!=r){
j=pre[i];
pre[i]=r;
i=j;
}
return r;
}
void join(int x,int y){
int fx=find(x),fy=find(y);
if(fx!=fy) pre[fx]=fy;
}
bool same(int x,int y){
return find(x)==find(y);
}
bool dist(int a,int b){
if((x[a]-x[b])*(x[a]-x[b])+(y[a]-y[b])*(y[a]-y[b])<=d*d)
return true;
else return false;
}
int main(){
scanf("%d %d",&n,&d);
init(n);//初始化
for(int i=1;i<=n;i++) scanf("%d%d",&x[i],&y[i]);
char c;
while(cin>>c){
if(c=='O'){
int r;
scanf("%d",&r);
vis[r]=1; //表明该点已经修过
for(int i=1;i<=n;i++){
if(i!=r&&vis[i]&&dist(i,r)){
join(i,r);
}
}
}
if(c=='S'){
int p,q;
scanf("%d %d",&p,&q);
if(same(p,q)) printf("SUCCESS\n");
else printf("FAIL\n");
}
}
return 0;
}