POJ -2236 Wireless Network
来源:互联网 发布:nginx日志 编辑:程序博客网 时间:2024/05/29 02:57
帅气的HYC很无奈
发布时间: 2015年11月1日 17:02 最后更新: 2015年11月1日 18:41 时间限制: 1000ms 内存限制: 128M
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.
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.
For each Testing operation, print "SUCCESS" if the two computers can communicate, or "FAIL" if not.
4 10 10 20 30 4O 1O 2O 4S 1 4O 3S 1 4
FAILSUCCESS
并查集
#include<stdio.h>#include<math.h>#include<string.h>int f[20000],book[20000];struct where{int x,y;}index[20000];int find(int x){if(f[x]==x)return x;elsereturn f[x]=find(f[x]);}void swap(int u,int v){int a,b;a=find(u);b=find(v);if(a!=b){f[b]=a;}}int main(){int i,n,d,p,q;char c;memset(book,0,sizeof(book));scanf("%d %d",&n,&d);for(i=1;i<=n;i++)f[i]=i;for(i=1;i<=n;i++)scanf("%d %d",&index[i].x,&index[i].y);while(scanf("%c",&c)!=EOF){if(c=='O'){scanf("%d",&p);book[p]=1;for(i=1;i<=n;i++){if(i!=p)if(book[i]){if(((index[i].x-index[p].x)*(index[i].x-index[p].x)+(index[i].y-index[p].y)*(index[i].y-index[p].y))<=d*d)swap(i,p);}}}else if(c=='S'){scanf("%d %d",&p,&q);if(find(p)==find(q))printf("SUCCESS\n");elseprintf("FAIL\n");}}return 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
- java操作mysql
- Jenkins 忘记密码解决方案
- Android Studio在线调试Android Framework Java代码
- 第三组内部linux比赛命题
- 【书海】《赢者思维》 ——读后总结
- POJ -2236 Wireless Network
- 时钟系统
- 【书海】《Head First Java》 ——读后总结
- 《Vertica的这些事》系列文章
- 《C和指针》学习
- Spring Security and Angular JS
- dos下的webservice 记忆
- 17、SSM框架-Spring mvc对于静态资源的访问(4)
- RMAN vs. Export