【并查集偏移量】HDU 1829 A Bug's Life

最新推荐文章于 2015-09-19 21:23:11 发布

井枯旋

最新推荐文章于 2015-09-19 21:23:11 发布

阅读量453

点赞数

分类专栏： ACM HDU

本文链接：https://blog.csdn.net/u013163567/article/details/24200319

版权

ACM 同时被 2 个专栏收录

71 篇文章 0 订阅

订阅专栏

HDU

34 篇文章 1 订阅

订阅专栏

HDU 1829 A Bug's Life

#include <iostream>
#include <string>
#include <algorithm>
#include <math.h>
#include <stdio.h>
#include <cstring>
#include <stdlib.h>
using namespace std;

int father[100001], rankk[100001], flag, n;

int get_fa(int x)
{
    if(x != father[x])
    {
        int t;
        t = get_fa(father[x]);
        rankk[x]=(rankk[x]+rankk[father[x]])%2;
        father[x] = t;
        return t;
    }
    return father[x];
}

void merge(int a, int b)
{
    int fa, fb;
    fa = get_fa(a), fb = get_fa(b);
    if(fa == fb)
    {
        if(rankk[a] == rankk[b])
            flag = 0;
    }
    else
    {
        father[fa] = fb;
        rankk[fa] = (rankk[a] + rankk[b] + 1) % 2;
    }
}
int main()
{
    int T,m,i,a,b,t;
    scanf("%d",&T);
    for(t=1; t<=T; ++t)
    {
        scanf("%d%d",&n,&m);
        flag=1;
        memset(rankk,0,sizeof(rankk));
        for(i=1; i<=n; ++i)
            father[i]=i;
        while(m--)
        {
            scanf("%d%d",&a,&b);
            if(!flag)
                continue;
            merge(a,b);
        }
        printf("Scenario #%d:\n",t);
        if(flag)
            printf("No suspicious bugs found!\n\n");
        else
            printf("Suspicious bugs found!\n\n");
    }
    return 0;
}