POJ 2236 Wireless Network

最新推荐文章于 2020-02-07 11:05:28 发布

忘梦心

最新推荐文章于 2020-02-07 11:05:28 发布

阅读量219

点赞数

分类专栏： POJ

本文链接：https://blog.csdn.net/weixin_45031646/article/details/90708432

版权

POJ 专栏收录该内容

121 篇文章 0 订阅

订阅专栏

Wireless Network

Time Limit: 10000MS Memory Limit: 65536K

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.

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:

“O p” (1 <= p <= N), which means repairing computer p.
“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

思路：

一道简单的并查集，模板会了本题就没有什么问题了，在并在一起的时候，可以将全部遍历一遍，如果出现电脑是修复好的且距离小于d的那么就并在一起，这样才不会漏，这样的代价就是时间复杂度有点大，幸好题目给的n只有一千而且最大10000ms所以这样直接遍历就行了。

#include <iostream>
#include <cmath>
using namespace std;
struct NODE {
	int x;
	int y;
	bool flag;
};
NODE node[1010];
int father[1010];
int findfather(int x) {
	int a = x;
	while (x != father[x]) x = father[x];
	while (a != father[a]) {
		int z = a;
		a = father[a];
		father[z] = x;
	}
	return x;
}
void unionfather(int a, int b) {
	int fa = findfather(a);
	int fb = findfather(b);
	if (fa != fb) father[fa] = fb;
}
int main() {
	int n, d;
	scanf("%d %d", &n, &d);
	for (int i = 1; i <= n; i++) father[i] = i;
	for (int i = 1; i <= n; i++) scanf("%d %d", &node[i].x, &node[i].y);
	char c;
	getchar();
	while (scanf("%c", &c) != EOF) {
		if (c == 'O') {
			int x;
			scanf("%d", &x);
			node[x].flag = true;
			for (int i = 1; i <= n; i++) {
				if (i != x && node[i].flag == true) {
					int d1 = (node[i].x - node[x].x) * (node[i].x - node[x].x);
					int d2 = (node[i].y - node[x].y) * (node[i].y - node[x].y);
					if ((d1 + d2) <= d * d) unionfather(i, x);
				} 
			}
		} else {
			int a, b;
			scanf("%d %d", &a, &b);
			if (findfather(a) != findfather(b)) cout << "FAIL\n";
			else cout << "SUCCESS\n"; 
		}
		getchar();
	}
	return 0;
}