poj 1703 Find them, Catch them

时间：2016-03-30 01:32:34 阅读：196 评论：0 收藏：0 [点我收藏+]

Find them, Catch them

Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64u

Description

The police office in Tadu City decides to say ends to the chaos, as launch actions to root up the TWO gangs in the city, Gang Dragon and Gang Snake. However, the police first needs to identify which gang a criminal belongs to. The present question is, given two criminals; do they belong to a same clan? You must give your judgment based on incomplete information. (Since the gangsters are always acting secretly.)

Assume N (N <= 10^5) criminals are currently in Tadu City, numbered from 1 to N. And of course, at least one of them belongs to Gang Dragon, and the same for Gang Snake. You will be given M (M <= 10^5) messages in sequence, which are in the following two kinds:

1. D [a] [b]
where [a] and [b] are the numbers of two criminals, and they belong to different gangs.

2. A [a] [b]
where [a] and [b] are the numbers of two criminals. This requires you to decide whether a and b belong to a same gang.

Input

The first line of the input contains a single integer T (1 <= T <= 20), the number of test cases. Then T cases follow. Each test case begins with a line with two integers N and M, followed by M lines each containing one message as described above.

Output

For each message "A [a] [b]" in each case, your program should give the judgment based on the information got before. The answers might be one of "In the same gang.", "In different gangs." and "Not sure yet."

Sample Input

#include<iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<math.h>
#define max1 100010
using namespace std;
int par[max1];
int ran[max1];
int find(int a)
{
    int rt;
    if(par[a]!=a)
    {
        int tmp=par[a];
        par[a]=find(par[a]);
        ran[a]=(ran[a]^ran[tmp]);

    }
    return par[a];
}
void build(int a,int b)
{
    //cout<<"here"<<endl;
    int fa=find(a);
    int fb=find(b);
    // if(fa!=fb)
    // {
    par[fa]=fb;
    ran[fa]=~(ran[b]^ran[a]);
    //  }
}
int main()
{
    int t;
    int n,m;
    char kind;
    int p1,p2;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&m);getchar();
        for(int i=0; i<=n; i++)
        {
            par[i]=i;
            ran[i]=0;
        }
        for(int i=1; i<=m; i++)
        {

            scanf("%c %d %d",&kind,&p1,&p2);getchar();
            if(kind==‘D‘)
            {
                build(p1,p2);
            }
            else
            {
                if(n==2)
                    printf("In different gangs.\n");
                else if(find(p1)==find(p2))
                {
                    if(ran[p1]==ran[p2])
                        printf("In the same gang.\n");
                    else
                        printf("In different gangs.\n");
                }
                else
                    printf("Not sure yet.\n");
            }
        }
    }
    return 0;
}

View Code

这个是ac代码，原理很简单，就是并查集，然后维护一个节点与根节点的关系。这里find函数要注意递归的顺序要在关系维护之前，这样才能保证每次维护的节点的关系都是跟

根节点之间的关系。否则的话更新的关系可能只是当前节点和上一次的根节点之间的关系。

附一份我说的这种错误的代码。wa过无数次，就是这个地方没有注意到。感谢徐暾大神的支持。

#include<iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<math.h>
#define max1 100010
using namespace std;
int par[max1];
int ran[max1];
int find(int a)
{
    int rt;
    if(par[a]!=a)
    {
        int tmp=par[a];
        ran[a]=(ran[a]^ran[tmp]);
        par[a]=find(par[a]);
    }
    return par[a];
}
void build(int a,int b)
{
    //cout<<"here"<<endl;
    int fa=find(a);
    int fb=find(b);
    // if(fa!=fb)
    // {
    par[fa]=fb;
    ran[fa]=~(ran[b]^ran[a]);
    //  }
}
int main()
{
    int t;
    int n,m;
    char kind;
    int p1,p2;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&m);getchar();
        for(int i=0; i<=n; i++)
        {
            par[i]=i;
            ran[i]=0;
        }
        for(int i=1; i<=m; i++)
        {

            scanf("%c %d %d",&kind,&p1,&p2);getchar();
            if(kind==‘D‘)
            {
                build(p1,p2);
            }
            else
            {
                if(n==2)
                    printf("In different gangs.\n");
                else if(find(p1)==find(p2))
                {
                    if(ran[p1]==ran[p2])
                        printf("In the same gang.\n");
                    else
                        printf("In different gangs.\n");
                }
                else
                    printf("Not sure yet.\n");
            }
        }
    }
    return 0;
}

View Code

所以说并查集的路径压缩一定要先压缩在维护关系，不然会出现一些稀奇古怪的东西。

poj 1703 Find them, Catch them

原文：http://www.cnblogs.com/superxuezhazha/p/5335513.html

踩

(0)

评论一句话评论（0）

分享档案

更多>

2021年09月23日 (328)
2021年09月24日 (313)
2021年09月17日 (191)
2021年09月15日 (369)
2021年09月16日 (411)
2021年09月13日 (439)
2021年09月11日 (398)
2021年09月12日 (393)
2021年09月10日 (160)
2021年09月08日 (222)