POJ-2236 Wireless Network
来源:互联网 发布:阿里云oss存储sdk 编辑:程序博客网 时间:2024/05/01 19:33
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
并查集,在同一个集合中的是已经修好的并且可以直接或间接相连的电脑。输入O的时候遍历所有已经修好的电脑,如果可以相连,就合并,输入S的时候查看两台电脑在不在一个集合中。
#include<iostream>#include<vector>#include<cmath>#include<string>using namespace std;struct node {int parent;bool repaired;int rank;node() {parent = 0;rank = 1;repaired = false;}};int get_parent(int x, vector<node>& v) {vector<int> path;while (x != v[x].parent) {path.push_back(x);x = v[x].parent;}for (int i = 0; i != path.size(); i++)v[path[i]].parent = x;return x;}void set_union(int x, int y, vector<node>& v) {int px = get_parent(x, v);int py = get_parent(y, v);if (v[px].rank > v[py].rank) {v[py].parent = px;}else {v[px].parent = py;if (v[px].rank == v[py].rank) {v[py].rank++;}}}int main() {int n, d; cin >> n >> d;vector<pair<int, int>> positions(n);for (int i = 0; i < n; i++)cin >> positions[i].first >> positions[i].second;vector<node> v(n);for (int i = 0; i < n; i++) {v[i].parent = i;}vector<vector<double> > distance(n, vector<double>(n, 0));for (int i = 0; i < n; i++) {for (int j = 0; j < n; j++) {distance[i][j] = sqrt(double((positions[i].first - positions[j].first) *(positions[i].first - positions[j].first) +(positions[i].second - positions[j].second) *(positions[i].second - positions[j].second)));distance[j][i] = distance[i][j];}}char type;vector<int> repaired;while (cin >> type) {if (type == 'O') {int num; cin >> num;for (int i = 0; i != repaired.size(); i++) {if (distance[num - 1][repaired[i]] <= d)set_union(num - 1, repaired[i], v);}repaired.push_back(num - 1);}if (type == 'S') {int num1, num2; cin >> num1 >> num2;if (get_parent(num1 - 1, v) == get_parent(num2 - 1, v))cout << "SUCCESS" << endl;else cout << "FAIL" << endl;}}}
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
- 在o(1)复杂度内删除结点
- cuda 学习 | GPU硬件与并行通信模式
- Spring Boot的启动器Starter详解
- docker镜像安装java-openjdk以及openjdk-debuginfo
- APP安全报告第十四期:十款热门旅行APP,竟有九款APP的安全评分不及格!
- POJ-2236 Wireless Network
- spring+springMVC+esayui框架
- spark开发环境搭建及部署
- linux中export和source的作用和区别
- DatabaseMetaData类
- 自动修改 Unity3d 导出的 Xcode 项目
- linux安装MQ报错解决方案
- Weex环境构建(五)多页面结构
- 学习笔记:Python函数的参数