Wireless Network
2016-04-14 23:55
267 查看
算法:并查集
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
4 1
0 1
0 2
0 3
0 4
O 1
O 2
O 4
S 1 4
O 3
S 1 4
Sample Output
FAIL
SUCCESS
代码:
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
4 1
0 1
0 2
0 3
0 4
O 1
O 2
O 4
S 1 4
O 3
S 1 4
Sample Output
FAIL
SUCCESS
代码:
#include <iostream> #include <algorithm> #include <cstring> #include <cmath> using namespace std; int pre[1005],dis[1005][2],dp[1005]; void cmp() { for(int i=1;i<=1000;i++) pre[i]=i; } int find(int x) { while(x!=pre[x]) x=pre[x]; return x; } int main() { int i,j,k,n,p,q; char ch; double m; cmp(); cin>>n>>m; for(i=1;i<=n;i++) cin>>dis[i][0]>>dis[i][1]; k=0; while(cin>>ch) { if(ch=='O') { cin>>dp[k]; k++; for(i=0;i<k-1;i++) { int fx=find(dp[k-1]); int fy=find(dp[i]); double sum=sqrt((dis[dp[i]][0]-dis[dp[k-1]][0])*(dis[dp[i]][0]-dis[dp[k-1]][0])+ (dis[dp[i]][1]-dis[dp[k-1]][1])*(dis[dp[i]][1]-dis[dp[k-1]][1])); if(fx!=fy&&sum<=m) pre[fx]=fy; } } else { cin>>p>>q; int fx=find(p); int fy=find(q); if(fx==fy) cout<<"SUCCESS"<<endl; else cout<<"FAIL"<<endl; } } return 0; }
相关文章推荐
- LruCache详解之 Android 内存优化
- 慎用MonthsBetweent和MonthSpan
- 20145223《Java程序程序设计》实验报告二
- Object常用方法介绍及注意事项equals(),hashCode(),getClass(),toString()
- 用mac终端创建一个.jar文件(转载)
- 修改进程占用内存SetProcessWorkingSetSize函数(多篇相关文章值得学习)
- JavaScript模板引擎实例应用
- 哲学的初步认识6
- Action View显示UI组件
- docker容器中安装vi命令
- 【C#进阶系列】21 托管堆和垃圾回收
- nyoj 67
- 【C#进阶系列】21 托管堆和垃圾回收
- 【202】ThinkPad手势&快捷键
- 腾讯一面总结
- linux网络相关命令
- 类与类之间的几种关系
- 并发编程初探-对象的组合
- RabbitMQ中 exchange、route、queue的关系
- maven学习