Wireless Network
Time Limit: 10000MS Memory Limit: 65536K Total Submissions: 29028 Accepted: 12027
Time Limit: 10000MS | Memory Limit: 65536K | |
Total Submissions: 29028 | Accepted: 12027 |
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
Source
POJ Monthly,HQM
个人理解:
考察并查集问题,pre用来存储上一级,find用来查找。
代码:
#include<stdio.h>
#include<string.h>
int pre[1005];
int n,d;
void init(){//初始化数组,使每个数组的上一级是自己
for(int i=1;i<=n;i++)
pre[i]=i;
}
int find(int x){//
while(x!=pre[x])
x=pre[x];
return x;
}
struct node { int x,y,id,vis;}a[1010];//各变量的意思分别是横纵坐标,标号,标志
int dis(int i,int j)
{
if(((a[i].x-a[j].x)*(a[i].x-a[j].x)+(a[i].y-a[j].y)*(a[i].y-a[j].y))>d*d)
return 0;
else return 1;
}
int main(){
scanf("%d%d",&n,&d);
init();
for(int i=1;i<=n;i++){
scanf("%d%d",&a[i].x,&a[i].y);
a[i].id=i;
a[i].vis=0;
}
char s[5];
int v,u;
while(scanf("%s",&s)!=EOF){
if(s[0]=='S'){
scanf("%d%d",&v,&u);
int dx=find(v);
int dy=find(u);
if(pre[dx]!=pre[dy])
printf("FAIL\n");
else printf("SUCCESS\n");
}
if(s[0]=='O'){
scanf("%d",&v);
a[v].vis=1;
int dx=find(v);
for(int i=1;i<=n;i++){
if(a[i].vis&&dis(v,i)&&v!=i){
int dy=find(i);
if(dx!=dy){
pre[dy]=dx;
}
}
}
}
}
return 0;
}