zoukankan      html  css  js  c++  java
  • POJ A-Wireless Network

    http://poj.org/problem?id=2236

    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

    题解:并查集

    代码:

    #include <stdio.h>
    #include <iostream>
    #include <string.h>
    using namespace std;
    
    int f[1010];
    int N, d;
    bool rep[1010];
    int q, p, n;
    
    int st[1010];
    int en[1010];
    
    void init() {
        for(int i = 1; i <= N; i ++) {
            f[i] = i;
            rep[i] = false;
        }
    }
    
    int Find(int x) {
        if(f[x] != x) f[x] = Find(f[x]);
        return f[x];
    }
    
    void Merge(int x, int y) {
        int fx = Find(x);
        int fy = Find(y);
        if(fx != fy)
            f[fx] = fy;
    }
    
    int main() {
        scanf("%d%d", &N, &d);
        init();
        for(int i = 1; i <= N; i ++)
            scanf("%d%d", &st[i], &en[i]);
    
        int f1, f2;
        char op;
        while(~scanf("%c", &op)) {
            if(op == 'O') {
                scanf("%d", &n);
                rep[n] = true;
                for(int i = 1; i <= N; i ++) {
                    if(i != n && rep[i] && (en[i] - en[n]) * (en[i] - en[n]) + (st[i] - st[n]) * (st[i] - st[n]) <= d * d) {
                        f1 = Find(n);
                        f2 = Find(i);
                        f[f1] = f2;
                    }
                }
            }
            else if(op == 'S'){
                scanf("%d%d", &q, &p);
                f1 = Find(p);
                f2 = Find(q);
    
                if(f1 == f2) printf("SUCCESS
    ");
                else printf("FAIL
    ");
            }
        }
        return 0;
    }
    

      

  • 相关阅读:
    Qt编译出错:“Cannot find file...... .pro."
    谈论如何有效地保护你的数据
    购书网
    VC非模态对话框创建和销毁
    在GUI程序中使用控制台的两种方法
    fatal error C1010: unexpected end of file while looking for precompiled header directive
    burp抓取手机包
    为firefox添加flash插件
    msfvenom生成linux后门
    kali下操作 Apache2
  • 原文地址:https://www.cnblogs.com/zlrrrr/p/9721766.html
Copyright © 2011-2022 走看看