POJ 2236 Wireless Network(并查集)
来源:互联网 发布:什么是淘宝黑搜 编辑:程序博客网 时间:2024/04/30 12:54
A - Wireless Network
Time Limit:10000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uDescription
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就合并,else就查询,需要注意的是join有个条件,就是在d的距离之内才可以!!!
AC代码:
#include<iostream>#include<cstdio>#include<cstring>using namespace std;#define N 1110int d;bool used[N];struct node{ int pre,x,y;}p[N];int find(int x){ return x==p[x].pre?x:find(p[x].pre);}void join(const node p1,const node p2){ int root1,root2; root1=find(p1.pre); root2=find(p2.pre); if (root1!=root2) { if ((p1.x-p2.x)*(p1.x-p2.x)+(p1.y-p2.y)*(p1.y-p2.y)<=d*d) { p[root2].pre=root1; } }}int main(){ int num; int ok; int from,to; cin>>num>>d; for (int i=1;i<=num;i++) { p[i].pre=i; } memset(used,0,sizeof(used)); for (int i=1;i<=num;i++) { cin>>p[i].x>>p[i].y; } string ope; while(cin>>ope) { if (ope=="O") { cin>>ok; used[ok]=true; for (int i=1;i<=num;i++) { if (used[i]&&i!=ok) join(p[i],p[ok]); } }else { scanf("%d%d", &from, &to); if(find(from) == find(to)) printf("SUCCESS\n"); else printf("FAIL\n"); } } 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 并查集
- 【学习心得】Link-cut Tree
- iOS开发常用类库
- LINUX下MYSQL的启动及相关配置
- 安装cassandra作为kairosdb的数据存储
- Android:屏幕旋转时,禁止Activity重新加载
- POJ 2236 Wireless Network(并查集)
- Caffe源码解读2--syncedmem.hpp
- fragment中弹出PopupWindow窗体,点击外界屏幕不消失问题解决
- numpy各函数简介之生成数组函数(Array creation routines)
- myeclipse下SSH整合环境搭建
- SVN和Git的比较
- 50. Pow(x, n)
- 安装mysql
- 观察者模式及Java实现例子