并查集—A - Wireless Network

最新推荐文章于 2021-08-26 18:32:22 发布

「已注销」

最新推荐文章于 2021-08-26 18:32:22 发布

阅读量208

点赞数

分类专栏：并查集

本文链接：https://blog.csdn.net/aaaaheiqiu/article/details/79114965

版权

并查集专栏收录该内容

4 篇文章 0 订阅

订阅专栏

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<stdio.h>
#include<math.h>
#include<string.h>
struct opint
{
    int x, y;
} pp[1008];

int open[1008];
int link[1008];

int findlink(int x)
{
    if(link[x]==x)
        return x;
    return findlink(link[x]);
}

void join(int a,int b)//把可以通信的放在一个组。
{
    int lina=findlink(a);
    int linb=findlink(b);
    if(lina!=linb)
        link[lina]=linb;
}

int dis(opint a, opint b, int c)
{
    double dis = sqrt((a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y));
    if(dis <= c)//可以通信的返回真。
        return 1;
    else
        return 0;
}

int main(void)
{
    memset(link, 0, sizeof(link));
    memset(open, 0, sizeof(open));//open是一个存放维修后的电脑的数组。
    int i,j,n,d;
    char operation;
    int p,q;
    scanf("%d%d",&n,&d);
    for(i=1; i<=n; i++)
        link[i]=i;
    for (i = 1; i <= n; i++)
    {
        scanf("%d%d", &pp[i].x, &pp[i].y);
    }

    while(~scanf(" %c %d",&operation,&p))//%c前面要有一个空格。
    {
        if(operation == 'S')//遇到 S 的字符，即查看电脑是否可以通信。
        {
            scanf("%d", &q);//需要再输入一个电脑。
            if(findlink(link[p]) == findlink(link[q]))//指p，q电脑属于一组。
                printf("SUCCESS\n");
            else
                printf("FAIL\n");
        }
        else
        {
            open[p]=1;
            for(j=1; j<=n; j++)
            {
                if(p!=j&&open[j])//遍历除了刚输入的修后的电脑外，其他修好的电脑。
                    if(dis(pp[p],pp[j],d))//在最大距离范围内都可以放一组。
                        join(p,j);
            }
        }
    }
    return 0;
}