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

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;
}

 

  • 2
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值