POJ 2236Wireless Network (并查集)
来源:互联网 发布:获奖证书制作软件 编辑:程序博客网 时间:2024/06/06 18:06
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.
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.
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 10 10 20 30 4O 1O 2O 4S 1 4O 3S 1 4
Sample Output
FAILSUCCESS
告诉几个点的坐标,O操作将电脑修复,S操作查询a,b两台电脑是否连通工作
#include <iostream>#include <stdio.h>#include <string>#include <cstring>#include <cmath>#include <algorithm>#define N 222222using namespace std;struct Node{ int x,y; int ff;}f[N];int n,d;int fa[N];int findfa(int x){ if(x==fa[x]) return fa[x]; return fa[x]=findfa(fa[x]);}double fun(int a,int b){ double ans; ans=(f[a].x-f[b].x)*(f[a].x-f[b].x)+(f[a].y-f[b].y)*(f[a].y-f[b].y); return ans;}void uniontwo(int a,int b){ int x=findfa(a); int y=findfa(b); if(x!=y) { if(x>y) fa[x]=y; else fa[y]=x; }}int main(){ while(~scanf("%d %d",&n,&d)) { for(int i=1;i<=n;i++) scanf("%d %d",&f[i].x,&f[i].y); char ch[10]; for(int i=0;i<=n;i++) { fa[i]=i; f[i].ff=0; } while(~scanf("%s",ch)) { if(ch[0]=='O') { int a; for(int i=1;i<=n;i++) { scanf("%d",&a); f[a].ff=1; if((f[i].ff && fun(i,a)<=d*d*1.0)) { uniontwo(i,a); } } } else { int a,b; scanf("%d %d",&a,&b); if(findfa(a)==findfa(b)) cout<<"SUCCESS"<<endl; else cout<<"FAIL"<<endl; } } } return 0;}
0 0
- POJ 2236 Wireless Network(并查集)
- POJ 2236 Wireless Network //并查集
- POJ 2236 WIRELESS NETWORK(并查集)
- POJ-2236 wireless network 并查集
- poj 2236 Wireless Network(并查集)
- poj 2236 - Wireless Network(并查集)
- POJ 2236 Wireless Network(并查集)
- poj 2236 Wireless Network(并查集)
- poj 2236 Wireless Network(并查集)
- poj 2236 Wireless Network 并查集
- POJ 2236 Wireless Network 并查集
- poj 2236 Wireless Network 并查集
- poj 2236 Wireless Network 【并查集】
- POJ 2236 Wireless Network (并查集)
- POJ 2236 Wireless Network(并查集)
- poj 2236 Wireless Network 并查集
- POJ 2236--Wireless Network【并查集】
- poj 2236 Wireless Network 并查集
- Java复习笔记8【super的简单用法】
- JAVA基础——GUI编程
- Java初始化顺序
- MySQL prepare预编译
- Remove Element(删除重复元素,循环删除2个及2个以上元素)
- POJ 2236Wireless Network (并查集)
- POJ 3660Cow Contest(并查集+拓扑排序)
- 关于老古董1602黑块的问题....
- rsyslog的多规则集
- 我的.Net学习之路二——File文件基本操作
- 【学习笔记】Hibernate中多对多不用List而用Set的原因分析
- C++库常用函数一览(<string><cctype><algorithm><cmath><cstdlib><iomanip><numeric>)
- 虚函数
- floyd UVA544 Heavy Cargo