Wireless Network
Time Limit: 10000MS | Memory Limit: 65536K | |
Total Submissions: 18869 | Accepted: 7938 |
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题意:一场小地震席卷了东南亚,通信设备全部损坏,现在准备派ACMer们去抢修。给出N个电脑的坐标,电脑初始全是坏的,当修好之后,如果两点之间的距离小于等于给定的D那么就可以通信,电脑与电脑之间还可以通过中间电脑中继通信。现给出一系列操作,包括修好某台电脑和测试两个电脑之间的通信。输出测试结果。
思路:每修好一个电脑,就遍历所有已修好的电脑,判断他们的通信情况,若可以通信则将两则合并。对于每次测试,判断两者是否在同一集合中。
代码:
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
#define maxn 1000+10
#define eps 1e-10
int n,d;
int x[maxn],y[maxn];
int fa[maxn];
bool v[maxn];
void init(){
for(int i=1;i<=n;i++) fa[i] = i;
memset(v,false,sizeof(v));
}
int findRoot(int t){
if(t==fa[t]) return t;
return findRoot(fa[t]);
}
void unionSet(int a,int b){
int x = findRoot(a);
int y = findRoot(b);
if(x==y) return;
fa[x] = y;
}
double dis(int i,int j){
return sqrt((x[i]-x[j])*(x[i]-x[j]) + (y[i]-y[j])*(y[i]-y[j]));
}
int main(){
scanf("%d %d",&n,&d);
for(int i=1;i<=n;i++){
scanf("%d %d",&x[i],&y[i]);
}
init();
int a,b;
char c;
getchar();
while(~scanf("%c",&c)){
//printf("@@%c\n",c);
if(c=='O'){
scanf("%d",&a);
v[a] = true;
for(int i=1;i<=n;i++){
if(v[i] && dis(i,a) <= d+eps){
if(findRoot(i)!=findRoot(a)) unionSet(i,a);
}
}
}else if(c=='S'){
scanf("%d %d",&a,&b);
if(findRoot(a)==findRoot(b)) printf("SUCCESS\n");
else printf("FAIL\n");
}
getchar();
}
return 0;
}