POJ---2236 Wireless Network【并查集】

最新推荐文章于 2020-01-21 00:58:18 发布

原创最新推荐文章于 2020-01-21 00:58:18 发布 · 321 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#IT #ACM #并查集

并查集专栏收录该内容

4 篇文章

订阅专栏

本文介绍了一种在受损网络中逐步修复计算机并测试其通信能力的方法。通过使用坐标和最大通信距离来确定哪些计算机可以相互连接，从而形成一个有效的网络。文章提供了一个具体的实现方案，包括如何处理修复操作和测试操作。

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

SOURCE:点击打开链接

题意：
    给你一些点，输入点的坐标，两点之间通信的最大距离为d，当前有两种操作，修复和测试。然后输出测试的结果。
代码：
#include <iostream>
#include<math.h>
#include <string.h>
using namespace std;
int par[1005];
struct point
{
    double x;
    double y;
} pt[1005];
int find(int p)
{
    return p==par[p]?p:par[p]=find(par[p]);
}


void unite(int x,int y)
{
    x=find(x);
    y=find(y);
    if(x!=y)
        par[y]=x;
}


double dis(point a,point b)
{
    return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
}


int main(void)
{
    int i,x,y,n;
    int num=0;
    int Count[1005];//用来记录计算机的台数
    double d;
    char control[2];
    cin>>n>>d;
    memset(Count,0,sizeof(Count));
    for(i=0; i<1005; i++)
        par[i]=i;
    for(i=1; i<=n; i++)
        cin>>pt[i].x>>pt[i].y;
    while(cin>>control)
    {
        if(*control=='O')
        {
            cin>>x;
            for(i=0; i<num; i++)
            {
                if(dis(pt[Count[i]],pt[x])<=d)//判断两点之间的距离是否小于d
                    unite(Count[i],x);//将两点连接起来，最终就都连起来了
            }
            Count[num++]=x;
        }
        else
        {
            cin>>x>>y;
            if(find(x)==find(y))
                cout<<"SUCCESS"<<endl;
            else
                cout<<"FAIL"<<endl;
        }
    }
    return 0;
}
<span class="Apple-style-span" style="font-weight: bold;">



</span>