A - 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

题意:
给出电脑台数n,两台电脑间最大可通信的距离d,(每台电脑只能与距离它不超过 d 米的其它电脑直接通信)。
输入n个点的坐标(xi, yi)
有两种操作:
O-a: 修复某台电脑
S-a-b:查询a,b两台电脑能否通信(如果a连通b,或者a连通c,c连通b,则a,b连通)
能通信输出"SUCCESS",否则输出"FAIL"。

题解:
每次修理好一台计算机的时候就遍历一下所有修好的计算机,看距离是否<=d,如果符合说明可以连通,将两台计算机所在集合合并。
每次检查的时候判断一下这两台计算机是否在同一集合中即可。

代码:

#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
const int maxn = 1005;

int dx[maxn], dy[maxn];
int p[maxn];
int rp[maxn] = {0};
int n, d, x, y, len = 0;
char op[2];

double dis(int a, int b){
  return sqrt(double(dx[a] - dx[b]) * (dx[a] - dx[b]) + double(dy[a] - dy[b]) * (dy[a] - dy[b]));
}

int find(int x){
  return p[x] != x ? p[x] = find(p[x]) : p[x];
}

int main()
{
  scanf("%d%d",&n,&d);
  for(int i = 1; i <= n; i ++)
    p[i] = i;

  for(int i = 1; i <= n; i ++)
    scanf("%d%d",&dx[i],&dy[i]);

  while(scanf("%s",op) != EOF){
    if(op[0] == 'O'){
    scanf("%d",&x);
    rp[++ len] = x;
    for(int i = 1;  i <= len; i ++)
      if(rp[i] != x && dis(rp[i], x) <= double(d)){
        p[find(rp[i])] = find(x);
      }
    }
    else{
      scanf("%d%d",&x,&y);
      puts(find(x) == find(y) ? "SUCCESS" : "FAIL");
    }
  }
  return 0;
}

/*
4 1
0 1
0 2
0 3
0 4
O 1
O 2
O 4
S 1 4
O 3
S 1 4
*/

点赞

发表评论

电子邮件地址不会被公开。必填项已用 * 标注