POJ 2236 Wireless Network
Wireless Network
Time Limit: 10000MS | Memory Limit: 65536K | |
Total Submissions: 12374 | Accepted: 5217 |
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 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
Source
POJ Monthly,HQM
#include <iostream> #include <stdio.h> #include <string.h> #include <algorithm> #include <queue> #include <cmath> #include <vector> using namespace std; vector <int> vc[1004]; bool v[1004]; struct node { double x,y; }a[1004]; int f[1004],r[1004]; double dis(double &x1,double &y1,double &x2,double &y2) { return sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2)); } int Find(int x) { if(x!=f[x]) return f[x]=Find(f[x]); return x; } void un(int x,int y) { x=Find(x); y=Find(y); if(x==y) return; if(r[x]>r[y]) f[y]=x; else if(r[x]==r[y]) f[y]=x,r[x]++; else f[x]=y; } int main() { int N; double d,tp; scanf("%d %lf",&N,&d); int i,j; for(i=1;i<=N;i++) { f[i]=i; scanf("%lf %lf",&a[i].x,&a[i].y); } memset(r,0,sizeof(r)); for(i=1;i<N;i++) for(j=i+1;j<=N;j++) { tp=dis(a[i].x,a[i].y,a[j].x,a[j].y); if(tp-d<=1e-8) { vc[i].push_back(j); vc[j].push_back(i); } } char op[3]; int x,y; while(scanf("%s",op)!=EOF) { if(op[0]=='O') { scanf("%d",&x); v[x]=1; for(i=0;i<vc[x].size();i++) if(v[vc[x][i]]) { un(x,vc[x][i]); } } else { scanf("%d %d",&x,&y); x=Find(x);y=Find(y); if(x==y)printf("SUCCESS\n"); else printf("FAIL\n"); } } return 0; }
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】博客园社区专享云产品让利特惠,阿里云新客6.5折上折
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步