POJ - 2236 Wireless Network

Wireless Network

题目链接：http://poj.org/problem?id=2236

Time Limit: 10000MS		Memory Limit: 65536K
Total Submissions: 27292		Accepted: 11291

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代码：

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
const int N=1000+5;
int par[N],rank[N];
void init(int n)
{for(int i=0;i<=n;i++){par[i]=i;rank[i]=0;}
}
int find(int x)
{if(par[x]==x)return x;else return par[x]=find(par[x]);
}
void unite(int x,int y)
{x=find(x);y=find(y);if(x==y)return ;if(rank[x]<rank[y]){par[x]=y;}else{par[y]=x;if(rank[x]==rank[y])rank[x]++; }
}
int main()
{int n,d;int x[N],y[N];cin>>n>>d;init(n);for(int i=1;i<=n;i++){scanf("%d%d",&x[i],&y[i]);}getchar();int vis[N]={0};int v[300000+5];int c=0;int a;char ch;while(cin>>ch){if(ch=='O'){cin>>a;vis[a]=1;v[c++]=a;for(int i=0;i<c-1;i++)if((x[a]-x[v[i]])*(x[a]-x[v[i]])+(y[a]-y[v[i]])*(y[a]-y[v[i]])<=d*d){unite(a,v[i]);}}else if(ch=='S'){int b;cin>>a>>b;if(find(a)==find(b)&&vis[a]&&vis[b])cout<<"SUCCESS"<<endl;else cout<<"FAIL"<<endl;}}return 0;
}

转载于:https://www.cnblogs.com/widsom/p/6729833.html

POJ - 2236 Wireless Network相关推荐

POJ 2236 Wireless Network 并查集
Wireless Network 并查集 Crawling in process... Crawling failed Time Limit:10000MS Memory Limit:6553 ...
POJ 2236 Wireless Network （并查集）
Wireless Network 题目链接: http://acm.hust.edu.cn/vjudge/contest/123393#problem/A Description An earthqu ...
POJ 2236 Wireless Network
传送门:http://poj.org/problem?id=2236 解题思路: 利用了并查集在操作一: 主要判断这个维修的电脑,和已经维修好的电脑的关系,如果他们的距离不大于题中限制的距离,就把他 ...
POJ 2236 - Wireless Network ( 并查集 )
题意一个计算机网络里的计算机都坏了, 现在有两种操作, "O p"代表修复了p机器, "S p q"代表检查 p, q 两台机器是否连接( 直线距离<= ...
POJ 2236 Wireless Network
题意:有n台电脑,分布在一个二维坐标系中,两台距离不超过d的电脑可以相互通信,初始所有的电脑都是坏的,给出一组操作,第一种操作是修复某台电脑,只有修好的电脑才可以互相通信,第二种操作是询问两台电脑是否 ...
A - Wireless Network POJ - 2236
A - Wireless Network POJ - 2236 并查集 if (op == 'S') {scanf("%d%d", &u, &v);if(vis[u ...
【POJ - 2236】Wireless Network （并查集）
题干: An earthquake takes place in Southeast Asia. The ACM (Asia Cooperated Medical team) have set up ...
[kuangbin带你飞]专题五并查集 A - Wireless Network
A - Wireless Network 题目链接:https://vjudge.net/contest/66964#problem/A 题目: An earthquake takes place i ...
Ad Hoc Networks TOPIC TWO ＜Wireless Network＞【Personal Notes】
Ad Hoc Networks TOPIC TWO Wireless Network GSM: FDD+TDMA GSM network architecture 情景一:网络如何识别新用户情景二: ...
Ubuntu 18.04/20.04 安装Qualcomm Atheros QCA6174 802.11ac Wireless Network Adapter 驱动
Ubuntu 18.04/20.04下Qualcomm Atheros QCA6174驱动安装缘起原因分析查找Google 详细步骤缘起买了新电脑,装上Ubuntu 20.04.奈何发现wi ...

POJ - 2236 Wireless Network

POJ - 2236 Wireless Network相关推荐

最新文章

热门文章