POJ2236

https://vjudge.net/problem/POJ-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<iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<cmath>
#define maxn 50010
using namespace std;
int n;
double d;
double dx[1005],dy[1005];
int pre[1005],repair[1005];
double dis(int a,int b)
{
    return sqrt((dx[a]-dx[b])*(dx[a]-dx[b])+(dy[a]-dy[b])*(dy[a]-dy[b]));
}
int Find(int x)
{
    if(x!=pre[x])
        return pre[x]=Find(pre[x]);
}
int Union(int x,int y)
{
    pre[Find(x)]=Find(y);
}
int main()
{
    cin>>n>>d;
    for(int i=1;i<=n;i++)
    {
        cin>>dx[i]>>dy[i];
        pre[i]=i;
    }
    char k;
    int p,q,len=0;
    getchar();
    while(~scanf("%c",&k))
    {
        if(k=='O')
            {
                cin>>p;
                repair[len++]=p;
                for(int i=0;i<len-1;i++)
                    if(dis(p,repair[i])<=d)
                       Union(repair[i],p);
            }
            else
            {
                cin>>p>>q;
                if(Find(p)==Find(q))
                    cout<<"SUCCESS"<<endl;
                else
                    cout<<"FAIL"<<endl;
            }
            getchar();
    }
    return 0;
}

版本二：

使用结构体

#include<iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<cmath>
#define maxn 1005
using namespace std;
int n;
double d;
struct node
{
    double x,y;
    int pre;//根节点
    int ranks;//树的高度
    bool repair;//是否修复
}link[maxn];
int Find(int x)
{
    if(x!=link[x].pre)
    return link[x].pre=Find(link[x].pre);
}
double dis(int i,int j)
{
    return sqrt((link[i].x-link[j].x)*(link[i].x-link[j].x)+(link[i].y-link[j].y)*(link[i].y-link[j].y));
}
void Union(int i,int j)
{
    //if(link[i].repair&&link[j].repair)
       // return 0;
    int root1=Find(i),root2=Find(j);
    //if(root1==root2)return 0;
    if(link[root1].ranks>link[root2].ranks)
    {
        link[root2].pre=root1;
        link[root1].ranks+=link[root2].ranks;
    }
    else
    {
        link[root1].pre=root2;
        link[root2].ranks+=link[root1].ranks;
    }
    //return 1;
}


int main()
{
    cin>>n>>d;
    for(int i=1;i<=n;i++)
    {
        cin>>link[i].x>>link[i].y;
        link[i].ranks=1;
        link[i].pre=i;
        link[i].repair=0;
    }
    char k;
    int p,q;
    getchar();
    while(~scanf("%c",&k))
    {
        if(k=='O')
            {
                cin>>p;
                link[p].repair=1;
                for(int i=1;i<=n;i++)
                {
                    if(Find(i)!=Find(p)&&link[i].repair&&dis(i,p)<=d)
                        Union(p,i);
                }
            }
            else
            {
                cin>>p>>q;
                if(Find(p)==Find(q))
                    cout<<"SUCCESS"<<endl;
                else
                    cout<<"FAIL"<<endl;
            }
            getchar();
    }
    return 0;
}

题目大意：

n个站点，已知站点的坐标。

‘O'操作 每次修通一个站点，该站点与距离该站点小于d且也为修通的站点联通；

’S'操作 查询两个站点是否联通。

思路：

并查集的题。设置距离函数，如果满足距离条件则将两个点合并。如果查询到的两点根节点相同则能联通。