POJ2236 Wireless Network【并查集】

Time Limit: 10000MS Memory Limit: 65536K
Total Submissions: 35269 Accepted: 14596


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. 


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. 


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



问题链接POJ2236 Wireless Network


  有n台计算机(编号1-2),并且有n行输入,每行有计算机的坐标x y。接着有若干命令,O p表示修好计算机p,S x y表示测试计算机x和y之间能否通信。








/* POJ2236 Wireless Network */

#include <iostream>
#include <stdio.h>

using namespace std;

const int N = 1001;
int f[N + 1], vis[N + 1];
struct {
    int x, y;
} p[N + 1];
int n, d;

void Init()
    for(int i = 1; i <= n; i++) {
        f[i] = i;
        vis[i] = 0;

int Find(int a) {
    return a == f[a] ? a : f[a] = Find(f[a]);

void Union(int s, int t)
    int ps = Find(s);
    int pt = Find(t);
    if(ps != pt) {
        if((p[s].x - p[t].x) * (p[s].x - p[t].x) + (p[s].y - p[t].y) * (p[s].y - p[t].y) <= d * d)
            f[pt] = ps;

int main()
    scanf("%d%d", &n, &d);


    char op;
    for(int i = 1; i <= n; i++)
        scanf("%d%d%*c", &p[i].x, &p[i].y);
    while(~scanf("%c", &op)) {
        if(op == 'O') {
            int p;
            scanf("%d", &p);
            vis[p] = 1;
            for(int i = 1; i <= n; i++)
                if(vis[i] && i != p)
                    Union(i, p);
        } else if(op == 'S') {
            int p, q;
            scanf("%d%d", &p, &q);
            printf("%s\n", Find(p) == Find(q) ? "SUCCESS" : "FAIL");

    return 0;