POJ 2236 Wireless Network 几何+并查集
来源:互联网 发布:淘宝代销赚钱吗 编辑:程序博客网 时间:2024/05/19 17:03
点击打开链接
Wireless Network
Time Limit: 10000MS Memory Limit: 65536KTotal Submissions: 14794 Accepted: 6227
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
有n台坏了电脑,知道它们的坐标,并且如果两台之间的距离小于d的话,并且这两台都修好了就可以联网,并且可以通过其它电脑连接。
简单并查集。
//4340K3079MS#include<stdio.h>#include<string.h>#include<math.h>#define M 1007char s[5];int x[M],y[M],pre[M],vis[M],g[M][M];int n,d;void init(){ memset(g,0,sizeof(g)); for(int i=1;i<=n;i++) { pre[i]=i; vis[i]=0; } }int find(int x){ while(x!=pre[x]) x=pre[x]; return x;}bool judge(int i,int j){ return ((y[j]-y[i])*(y[j]-y[i])+(x[j]-x[i])*(x[j]-x[i]))<=d*d;}int main(){ scanf("%d%d",&n,&d); init(); int a,b,c; for(int i=1;i<=n;i++) scanf("%d%d",&x[i],&y[i]); while(scanf("%s",s)!=EOF) { if(s[0]=='O') { scanf("%d",&c); vis[c]=1; for(int i=1;i<=n;i++) { if(i==c)continue; if(judge(c,i)&&vis[i]) { int xx=find(c); int yy=find(i); pre[xx]=yy; } } } if(s[0]=='S') { scanf("%d%d",&a,&b); if(find(a)==find(b))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【并查集】
- Java内存区域及Java垃圾回收机制概述
- java调用weka里面的分类器做回归
- spring整合myBatis
- 手机GUI自动化测试简介
- 将二维数组绘制成三维的图像
- POJ 2236 Wireless Network 几何+并查集
- RGB颜色对照表
- 我的处女作
- VIM一些让人头疼的东西!(不断更新)
- ZooKeeper伪分布式集群安装及使用
- 汉澳sinox替换xp成功10年内为国家节省上万亿
- 【底软】NANDFlash与NORFLASH
- float
- java基础知识(一) JDK动态代理