POJ 2492(并查集)

problem

Background
Professor Hopper is researching the sexual behavior of a rare species of bugs. He assumes that they feature two different genders and that they only interact with bugs of the opposite gender. In his experiment, individual bugs and their interactions were easy to identify, because numbers were printed on their backs.
Problem
Given a list of bug interactions, decide whether the experiment supports his assumption of two genders with no homosexual bugs or if it contains some bug interactions that falsify it.

Input

The first line of the input contains the number of scenarios. Each scenario starts with one line giving the number of bugs (at least one, and up to 2000) and the number of interactions (up to 1000000) separated by a single space. In the following lines, each interaction is given in the form of two distinct bug numbers separated by a single space. Bugs are numbered consecutively starting from one.

Output

The output for every scenario is a line containing “Scenario #i:”, where i is the number of the scenario starting at 1, followed by one line saying either “No suspicious bugs found!” if the experiment is consistent with his assumption about the bugs’ sexual behavior, or “Suspicious bugs found!” if Professor Hopper’s assumption is definitely wrong.

Sample Input

2
3 3
1 2
2 3
1 3
4 2
1 2
3 4

Sample Output

Scenario #1:
Suspicious bugs found!

Scenario #2:
No suspicious bugs found!

Hint

Huge input,scanf is recommended.

思路

简单的带权并查集

代码示例

#include<iostream>
#include<cstdio>
using namespace std;

const int maxn=2010;
int father[maxn];
int relation[maxn];

int Fid(int x)
{
    int t;
    if(father[x]==x) return x;
    t=father[x];
    father[x]=Fid(father[x]);
    relation[x]=(relation[x]+relation[t]+1)%2;
    return father[x];
}

void Merge(int a,int b)
{
    int x,y;
    x=Fid(a);
    y=Fid(b);
    father[x]=y;
    relation[x]=(relation[b]-relation[a])%2;
}

int main()
{
    int T,m,n,i,j,a,b;
    scanf("%d",&T);
    for(i=1;i<=T;++i)
    {
        int flag=0;
        scanf("%d%d",&n,&m);
        for(j=1;j<=n;++j)       //初始化
        {
            father[j]=j;
            relation[j]=1;
        }
        for(j=1;j<=m;++j)
        {
            scanf("%d%d",&a,&b);
            if(Fid(a)==Fid(b))
            {
            //    if(relation[a]!=(relation[b]+1)%2)
                if(relation[a]==relation[b])            //说明是同性
                    flag=1;
            }
            else Merge(a,b);
        }
        if(flag)
            printf("Scenario #%d:\nSuspicious bugs found!\n\n",i);
        else
            printf("Scenario #%d:\nNo suspicious bugs found!\n\n",i);
    }
    return 0;
}

更好理解的写法

#include<iostream>
using namespace std;
const int Max = 2005;

int n, m;
int parent[Max], opp[Max];

void make_set()
{
    for(int x = 1; x <= n; x ++)
    {
        parent[x] = x;
        opp[x] = 0;
    }
}



int find_set(int x)
{
    if(x != parent[x])
        parent[x] = find_set(parent[x]);
    return parent[x];
}



void union_set(int x, int y)
{
    x = find_set(x);
    y = find_set(y);
    if(x == y)
        return;
    parent[y] = x;
}



int main()
{
    int t, i, x, y;
    scanf("%d", &t);
    for(i = 1; i <= t; i ++)
    {
        scanf("%d %d", &n, &m);
        make_set();
        bool flag = false;
        while(m--)
        {
            scanf("%d %d", &x, &y);
            if(flag)
                continue;
            if(find_set(x) == find_set(y))
            {  // 若x，y同在一个集合，则证明有同性的可疑。
                flag = true;
            }
            if(opp[x] == 0 && opp[y] == 0)
            {
                opp[x] = y;//表明y是x的异性
                opp[y] = x;
            }
            else if(opp[x] == 0)
            {
                opp[x] = y;
                union_set(x, opp[y]);//同性合并
            }
            else if(opp[y] == 0)
            {
                opp[y] = x;
                union_set(y, opp[x]);
            }
            else
            {
                union_set(x, opp[y]);
                union_set(y, opp[x]);
            }
        }
        printf("Scenario #%d:\n", i);
        if(flag)
            printf("Suspicious bugs found!\n\n");
        else
            printf("No suspicious bugs found!\n\n");
    }
    return 0;
}