Wireless Network（并差集）

最新推荐文章于 2019-01-20 19:10:00 发布

LeeBooL

最新推荐文章于 2019-01-20 19:10:00 发布

阅读量306

点赞数

分类专栏：并差集 POJ

本文链接：https://blog.csdn.net/u013570474/article/details/44244219

版权

POJ 同时被 2 个专栏收录

93 篇文章 0 订阅

订阅专栏

并差集

15 篇文章 0 订阅

订阅专栏

#include <iostream>
#include <string.h>
#include <stdio.h>
#include <cmath>
#include <stdlib.h>
#include <vector>
using namespace std;
#define MAXN 1111
int fa[MAXN];
int x[MAXN], y[MAXN];
bool ok[MAXN];
vector<int> rel[MAXN];
int n, d;

bool getdis(int i, int j)
{
    int res = (x[i] - x[j]) * ( x[i] - x[j]) + (y[i] - y[j]) * (y[i] - y[j]);
    if(d >= res)
        return true;
    return false;
}

int findfa(int x)
{
    if(fa[x] == -1)
        return x;
    return fa[x] = findfa(fa[x]);
}

void unio(int x, int y)
{
    int fax = findfa(x);
    int fay = findfa(y);
    if(fax != fay)
      fa[fax] = fay;
}
int main()
{
    scanf("%d %d",&n, &d);
    d*=d;
    memset(fa, -1, sizeof(fa));
    memset(rel, 0, sizeof(rel));
    memset(ok, 0, sizeof(ok));
    for(int i = 1; i <= n; i++)
     {
         scanf("%d %d",&x[i], &y[i]);
         rel[i].clear();
     }
    for(int i = 1; i <= n; i++)
      for(int j = i + 1; j<= n; j++)
        {
            if(getdis(i, j))
            {
                rel[i].push_back(j);
                rel[j].push_back(i);
            }
        }
    char op;
    int a,b;

    while(cin>>op)
    {

        if(op == 'O')
        {
            scanf("%d",&a);
            ok[a] = 1;
            for(int i = 0; i < rel[a].size(); i++)
               {
                   if(ok[rel[a][i]])
                     unio(rel[a][i],a);
                   //cout<<rel[a][i]<< " "<<fa[rel[a][i]]<<endl;

               } //cout<<"--------"<<endl;
        }
        else if(op == 'S')
        {
            scanf("%d %d",&a, &b);
            if(findfa(a) != findfa(b))
              printf("FAIL\n");
            else
              printf("SUCCESS\n");
        }
    }



    return 0;
}