zoukankan      html  css  js  c++  java
  • POJ2236(并查集入门)

    Wireless Network
    Time Limit: 10000MS   Memory Limit: 65536K
    Total Submissions: 22977   Accepted: 9613

    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
    #include <cstdio>
    #include <cstring>
    #include <cmath>
    using namespace std;
    const int MAXN=1005;
    struct Node{
        int x,y;
    }nodes[MAXN];
    int n,d;
    bool state[MAXN];
    int par[MAXN];
    void prep()
    {
        for(int i=0;i<MAXN;i++)
        {
            par[i]=i;
        }
    }
    int fnd(int x)
    {
        if(par[x]==x)
        {
            return x;
        }
        return par[x]=fnd(par[x]);
    }
    void unite(int x,int y)
    {
        int a=fnd(x);
        int b=fnd(y);
        par[b]=a;
    }
    bool same(int x,int y)
    {
        return fnd(x)==fnd(y);
    }
    double dist(int x1,int y1,int x2,int y2)
    {
        return sqrt(1.0*(x1-x2)*(x1-x2)+1.0*(y1-y2)*(y1-y2));
    }
    int main()
    {
        prep();
        memset(state,false,sizeof(state));
        scanf("%d%d",&n,&d);
        for(int i=1;i<=n;i++)
        {
            scanf("%d%d",&nodes[i].x,&nodes[i].y);
        }
        getchar();
        char op;
        while(scanf("%c",&op)!=EOF)
        {
            if(op=='O')
            {
                int id;
                scanf("%d",&id);
                state[id]=true;
                for(int i=1;i<=n;i++)
                {
                    if(i==id)    continue;
                    double len=dist(nodes[id].x,nodes[id].y,nodes[i].x,nodes[i].y);
                    if(state[i]&&!same(i,id)&&len<=d)
                    {
                        unite(id,i);
                    }
                }
            }
            else
            {
                int x,y;
                scanf("%d%d",&x,&y);
                if(state[x]&&state[y]&&same(x,y))
                {
                    printf("SUCCESS
    ");
                }
                else
                {
                    printf("FAIL
    ");
                }
            }
            getchar();
        }
        
        return 0;
    }
  • 相关阅读:
    jdbc连接池工具与pg fdw连接的问题
    关于drill http存储插件http 超时的一些说明
    tds-fdw PostgreSQL said: DB-Library error: DB #: 20002, DB Msg: Adaptive Server connection failed, OS #: 0, OS Msg: Success, Level: 9 问题解决.md
    开发自己的jdbc驱动——可选开发工具
    nexus Invalid state: DELETED; allowed: [STARTED] 问题解决
    airline开发类似git cli 的jar 包
    开发自己的jdbc驱动——基本说明
    nessie 安装&&简单试用
    nessie 类似git 管理数据湖
    一些不错的开源大数据虚拟数据sql 查询引擎
  • 原文地址:https://www.cnblogs.com/program-ccc/p/5679568.html
Copyright © 2011-2022 走看看