POJ 2236-Wireless Network(并查集)
来源:互联网 发布:mac 命令行 删除软件 编辑:程序博客网 时间:2024/05/19 23:16
Wireless Network
Time Limit: 10000MS Memory Limit: 65536KTotal Submissions: 21632 Accepted: 9060
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
Source
POJ Monthly,HQM
/* * Copyright (c) 2016, 烟台大学计算机与控制工程学院 * All rights reserved. * 文件名称:father.cpp * 作 者:单昕昕 * 完成日期:2016年1月19日 * 版 本 号:v1.0 */ #include <iostream>#include <cstring>#include <cstdio>using namespace std;const int N=1000+3;int x[N],y[N],set[N];bool valid[N];int set_find(int d){ if (set[d]<0) return d; return set[d]=set_find(set[d]);}void join(int p,int q){ p=set_find(p); q=set_find(q); if(p!=q) set[p]=q;}int main(){ int n,d,i,p,q; char c; scanf("%d%d",&n,&d); for(i=1; i<=n; ++i) scanf("%d%d",&x[i],&y[i]); memset(valid,false,sizeof(valid)); memset(set,-1,sizeof(set)); while(cin>>c) { if(c=='O') { scanf("%d",&p); valid[p]=true; for(i=1; i<=n; ++i) if(valid[i]&&((x[i]-x[p])*(x[i]-x[p])+(y[i]-y[p])*(y[i]-y[p])<=d*d))//距离 join(i,p); } else if(c=='S') { scanf("%d%d",&p,&q); if(set_find(p)==set_find(q)) printf("%s\n","SUCCESS"); else printf("%s\n","FAIL"); } } 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 并查集
- 清除浮动
- 关于垃圾回收的小结
- JBPM4关于Assignee动态获取------OA系统工作流环节问题
- 游戏人物
- 69. Sqrt(x)
- POJ 2236-Wireless Network(并查集)
- nginx负载均衡配置
- iOS UIDevice- NSBundle - NSlocale
- 111-e-Minimum Depth of Binary Tree
- bzoj 3876(有上下界的最小费用流)
- 游戏人物 退出江湖
- 【再谈后缀自动机(入门)】[SPOJLCS2]Longest Common Substring II
- h264 NAL头解析
- 进程调度