POJ【2236】Wireless Network
2016-01-25 09:37
295 查看
Wireless Network
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
Time Limit: 10000MS | Memory Limit: 65536K | |
Total Submissions: 20631 | Accepted: 8679 |
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 <cstdio> #include <cstring> #include <iostream> #include <cmath> using namespace std; const int maxn = 1010; int fa[maxn],d,N; struct Node { int x,y; }node[maxn]; //保存每个结点的坐标 bool dist(Node &node1,Node &node2) //判断2个结点之间的距离是否小于d { return ((node1.x-node2.x)*(node1.x-node2.x)+(node1.y-node2.y)*(node1.y-node2.y)) <= d*d; } int Find(int x) { if(fa[x] == -1 || fa[x] == x) return x; //多加了一个条件当fa[x]==-1时的判断 else if(x != fa[x]) fa[x] = Find(fa[x]); return fa[x]; } int main() { char c; scanf("%d%d",&N,&d); memset(fa,-1,sizeof(fa)); for(int i = 1 ; i <= N; i++) scanf("%d%d",&node[i].x,&node[i].y); while(scanf(" %c",&c) != EOF) //换行符需要注意处理 { if(c == 'O') { int x; scanf("%d",&x); fa[x] = x; for(int i = 1 ; i <= N; i++) if(i != x && fa[i] != -1 && dist(node[x],node[i])) { int fi = Find(i); fa[fi] = x; //合并 } } else { int a,b; scanf("%d%d",&a,&b); if(Find(a) == Find(b)) //2个点在同一个集合中 printf("SUCCESS\n"); else printf("FAIL\n"); } } return 0; }
相关文章推荐
- LeetCode Remove Duplicates from Sorted Array II
- The most common (worst) passwords of 201
- HttpContext.Current.Session.SessionID相关问题及备忘
- C#:使用WebRequest类请求数据
- Xcode下的DerivedData文件
- 详解 ASP.NET异步
- iOS 整理iOS9适配中出现的坑
- linux下修改环境变量问题
- 提高网站打开速度的7大秘籍---依据Yslow工具的优化【转】
- 配置apache和nginx的tomcat负载均衡
- 判断一个字符串中所有字符是否属于别一个字符串
- java提高篇-----详解java的四舍五入与保留位
- Linux系统的ssh密钥认证
- 【胡思乱想】许久不见,我来除除草
- 使用绑定式服务播放音乐
- OpenCV 2.4.9 +VS2010 开发环境配置(二)
- 《皮囊》读书笔记
- LabWindows/CVI线程操作
- 关于MySQL数据导出导入的文章
- LightOJ1316 A Wedding Party(状压DP)