POJ 2236 - Wireless Network
来源:互联网 发布:ubuntu root无声音 编辑:程序博客网 时间:2024/06/14 02:56
A - Wireless Network
Time Limit:10000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uAppoint description:
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
水题
#include <iostream>#include <cstdio>#include <cstring>using namespace std;#define N 1005bool vis[N];int f[N];int n,d;struct Point{ int x,y;}p[N];int _find(int x){ if (x!=f[x]) return f[x]=_find(f[x]); return x;}bool check(int u,int v){ int a=p[u].x-p[v].x; int b=p[u].y-p[v].y; return (a*a+b*b)<=d*d;}int main(){ scanf("%d%d",&n,&d); for (int i=1;i<=n;i++){ vis[i]=false; f[i]=i; scanf("%d%d",&p[i].x,&p[i].y); } char c; while (cin>>c){ if (c=='O'){ int u; scanf("%d",&u); vis[u]=true; for (int i=1;i<=n;i++){ if (i!=u && vis[i] && check(i,u)){ int x=_find(i); int y=_find(u); f[x]=y; } } } if (c=='S'){ int u,v; scanf("%d%d",&u,&v); if (_find(u)!=_find(v)){ printf("FAIL\n"); }else{ printf("SUCCESS\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 2236Wireless Network
- POJ 2236 Wireless Network
- POJ 2236 Wireless Network
- POJ 2236 Wireless Network
- Linux统计某文件夹下文件、文件夹的个数
- hdu1050 活动安排问题(有坑)
- c盘下安装的文件访问权限问题
- 欢迎使用CSDN-markdown编辑器
- 由常量池 运行时常量池 String intern方法想到的(一)
- POJ 2236 - Wireless Network
- c# 动态设置控件位置
- 重学备忘
- 文章标题
- An instance of “(null)” is already running. Choose “Stop” to terminate and launch a new instance.
- Leet Code OJ 268. Missing Number [Difficulty: Medium]
- ubuntu 切换python3 和 python2
- Android工程的编译过程
- POJ 1611 - The Suspects