POJ-2236.WireleseNetwork.(并查集)

　　

Wireless Network

Time Limit: 10000MS		Memory Limit: 65536K
Total Submissions: 43199		Accepted: 17800

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: 
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 <cstdio>
#include <cmath>
using namespace std;

const int maxn = 1000 + 5;
struct coordinate {
    int x, y;
} G[maxn];
int n, d, p, q, cnt, head[maxn], Rank[maxn];
int isrepair[maxn];
char operation;

double dis(int u, int v) {
    return sqrt((double)(G[u].x - G[v].x) * (G[u].x - G[v].x) + (G[u].y - G[v].y) * (G[u].y - G[v].y));
}

int find(int x) {
    if(head[x] == x) return x;
    return head[x] = find(head[x]);
}

void Union_set(int x, int y) {
    int dx = find(x), dy = find(y);
    if(dx == dy)    return;
    if(Rank[dx] > Rank[dy]) head[dx] = dy;
    else {
        head[dy] = dx;
        if(Rank[dx] == Rank[dy])
            Rank[dx] ++;
    }
}

bool Is_same(int u, int v) {
    return find(u) == find(v);
}

int main () {
    cnt = 1;
    scanf("%d %d", &n, &d);
    for(int i = 1; i <= n; i ++)
        scanf("%d %d", &G[i].x, &G[i].y);
    for(int i = 1; i <= n; i ++) {
        head[i] = i;
        Rank[i] = 0;
    }
    while(~scanf("%c", &operation)) {
        if(operation == 'O') {
            scanf("%d", &p);
            for(int i = 1; i <= cnt; i ++) {
                if(dis(p, isrepair[i]) <= d) {
                    Union_set(isrepair[i], p);
                }
            }
            isrepair[cnt ++] = p;
        }
        else if(operation == 'S') {
            scanf("%d %d", &p, &q);
            if(Is_same(p, q))
                printf("SUCCESS
");
            else
                printf("FAIL
");
        }
    }
    return 0;
}