POJ2493 A Bug's Life并查集看是否出现了环

最新推荐文章于 2024-06-23 09:17:33 发布

原创最新推荐文章于 2024-06-23 09:17:33 发布 · 302 阅读

1 ·

CC 4.0 BY-SA版权

ACM并查集专栏收录该内容

30 篇文章

订阅专栏

本文深入解析了POJ 2492问题，通过使用并查集算法来判断一组虫子之间的互动是否符合两性假设，即是否存在同性互动的异常情况。通过对每一对互动的虫子进行查找和合并操作，可以有效地检测出是否存在违反假设的环状结构。

http://poj.org/problem?id=2492

Description

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.

//也就是判断是否出现了环
#include <stdio.h>
#include <string.h>
int fa[2005];
int rela[2005];
bool bugs;
void init(int n)
{
    for(int i=1; i<=n; i++)
        fa[i]=i,rela[i]=0;
}
int find(int x)
{
    if(fa[x]!=x) fa[x]=find(fa[x]);
    return fa[x];
}
void uni(int a,int b)
{
    int aa=find(a);
    int bb=find(b);
    if(aa!=bb)
        fa[aa]=bb;
}
int main()
{
    int ncase;
    int t=1;
    scanf("%d",&ncase);
    while(ncase--)
    {
        int n,m;
        scanf("%d %d",&n,&m);
        init(n);
        bugs=false;
        for(int i=0; i<m; i++)
        {
            int x,y;
            scanf("%d %d",&x,&y);
            if(!bugs)
            {
                int xx=find(x);
                int yy=find(y);//¸¸½Úµã;
                if(xx==yy) bugs=true;
                if(rela[x]) uni(rela[x],y);
                else rela[x]=y;//ÈôÊÇrela
                if(rela[y]) uni(rela[y],x);
                else rela[y]=x;
                //这就判断出了出现了环;非常重要！
            }
        }
        printf("Scenario #%d:\n",t++);
        if(bugs)
            puts("Suspicious bugs found!\n");
        else
            puts("No suspicious bugs found!\n");
    }
    return 0;
}