POJ2236 Wireless Network(并查集)

最新推荐文章于 2023-07-28 22:33:57 发布

原创最新推荐文章于 2023-07-28 22:33:57 发布 · 350 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#并查集

【并查集/欧拉路/最小生成树】专栏收录该内容

43 篇文章

订阅专栏

本文介绍了一个模拟地震后无线网络修复的算法问题。通过并查集数据结构实现对计算机网络连通性的判断，解决计算机间能否通信的问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目：

Wireless Network

Time Limit: 10000MS		Memory Limit: 65536K
Total Submissions: 25797		Accepted: 10732

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.

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

Sample Output

FAIL
SUCCESS

Source

POJ Monthly,HQM

[Submit] [Go Back] [Status] [Discuss]

思路：

一张图上分布着n台坏了的电脑，并知道它们的坐标。两台修好的电脑如果距离<=d就可以联网，也可以通过其他修好的电脑间接相连。给出操作“O x”表示修好x，给出操作“S x y”，请你判断x和y在此时有没有连接上。

代码：

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <string>
#include <iostream>
#include <stack>
#include <queue>
#include <vector>
#include <algorithm>
#define mem(a,b) memset(a,b,sizeof(a))
#define N 1000+20
#define M 100000+20
#define MOD 1000000000+7
#define inf 0x3f3f3f3f
using namespace std;
struct node
{
    int x,y;
} p[N];//存储坐标
int f[N];//存储并查集的关系
int rep[N];//存储机器的编号
void init(int n)
{
    for(int i=1; i<=n; i++)
        f[i]=i;
}
int dist(node a,node b)
{
    return (a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y);
}
int find(int x)
{
    if(f[x]!=x)
        f[x]=find(f[x]);
    return f[x];
}
void mix(int x,int y)
{
    x=find(x);
    y=find(y);
    if(x!=y)
        f[y]=x;
}
int main()
{
    char ch[5];
    int n,d,x,y;
    scanf("%d%d",&n,&d);
    for(int i=1; i<=n; i++)
        scanf("%d%d",&p[i].x,&p[i].y);
    int cnt=0;
    init(n);//初始化并查集
    while(~scanf("%s",ch))
    {
        if(ch[0]=='O')//修理机器
        {
            scanf("%d",&x);
            for(int i=0; i<cnt; i++)
                if(dist(p[rep[i]],p[x])<=d*d)//如果两台机器可以连接，就加入并查集
                    mix(rep[i],x);
            rep[cnt++]=x;//存储修好的编号
        }
        else//询问机器
        {
            scanf("%d%d",&x,&y);
            x=find(x);
            y=find(y);
            if(x==y)
                printf("SUCCESS\n");
            else
                printf("FAIL\n");
        }
    }
    return 0;
}