POJ 2236 Wireless Network
来源:互联网 发布:基于linux的嵌入式开发 编辑:程序博客网 时间:2024/05/19 17:11
Wireless Network
Time Limit: 10000MS Memory Limit: 65536KTotal Submissions: 16131 Accepted: 6801
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
哇 ,自己做并查集,一次ac。。
#include <iostream>#include <cstring>#define maxn 1005using namespace std;struct point{ int mast; int x,y;}f[maxn];int find(int x){ if(f[x].mast==x) return x; else return (f[x].mast=find(f[x].mast));}int main(){ int n,d; cin>>n>>d; int i; for(i=1;i<=n;i++) { cin>>f[i].x>>f[i].y; f[i].mast=i; } char s; bool pd[maxn]; memset(pd,0,sizeof(pd)); while(cin>>s) { if(s=='S') { int x,y; cin>>x>>y; if(find(x)==find(y)) cout<<"SUCCESS"<<endl; else cout<<"FAIL"<<endl; } if(s=='O') { int x; cin>>x; pd[x]=1; for(i=1;i<=n;i++) { if(pd[i]==1&&i!=x) { if((f[i].x-f[x].x)*(f[i].x-f[x].x)+(f[i].y-f[x].y)*(f[i].y-f[x].y)<=d*d) { int a,b; a=find(i); b=find(x); if(a!=b) f[a].mast=b; } } } } } 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 2236Wireless Network
- POJ 2236 Wireless Network
- POJ 2236 Wireless Network
- POJ 2236 Wireless Network
- 用 OpenCV 编写一个简单的摄像头视频监控程序
- 设计模式--之command模式笔记
- Android4.4深入浅出之SurfaceFlinger框架-渲染一个surface(二)
- Spring AOP 完成日志记录
- 一个令人纠结的弹窗问题,鼠标放上去显示div,鼠标离开div消失
- POJ 2236 Wireless Network
- Java Servlet Specification 3.0 之异步处理
- 为什么要努力?
- Android之Activity加载模式简要概述
- cocos2dx常见的46中+22中动作详解
- 设计模式--之state模式 笔记
- Myeclipse6.0.1注册码获取方法
- 设计模式--之Mediator模式 笔记
- poj3468 线段树多段更新学习