poj2492

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

跟1703一样 两种状态 并查集+偏移量

两只虫子发射架关系 判断有没有虫子是同性恋 两两合并 在一棵树上找右没有两个节点跟跟节点的关系（只有0,1两种）是相同的，相同就是gay

注意一点 两组数据间有空行 

#include <stdio.h>
#include <stdlib.h>
int father[2001],num[2001],r[2001];
int find(int x)
{
    if(x!=father[x])
    {
        int y = father[x];
        father[x] = find(father[x]);
        num[x] = (num[x]+num[y])%2;
    }
    return father[x];
}
void union1(int x, int y)
{
    int x1 = find(x);
    int y1 = find(y);
    if(x1!=y1)
    {
        if(r[x1]>r[y1])
        {
            father[y1] = x1;
            num[y1] = (num[x]-num[y]+1)%2;
        }
        else
        {
            father[x1] = y1;
            num[x1] = (num[y]-num[x]+1)%2;
            if(r[x1] == r[y1])
            r[y1]++;
        }
    }
}
int main()
{
    int i, j, m, n,t,a,b,g;
    long k;
    scanf("%d", &t);
    while(t--)
    {
        k++;
        scanf("%d%d", &n, &m);
        int flag = 0;
        for(i = 1 ; i <= n ; i++)
        {
            father[i] = i;
            r[i] = 0;
            num[i] = 0;
        }
        j = 0;
        for(i = 1 ; i <= m ; i++)
        {
            scanf("%d%d", &a,&b);
            if(a!=b)
            union1(a,b);
            if(find(a) == find(b)&&num[a]==num[b])
            flag = 1;
        }
        printf("Scenario #%ld:\n",k);
        if(flag == 0)
        printf("No suspicious bugs found!\n");
        else
        printf("Suspicious bugs found!\n");
        if(t!=0)
        printf("\n");
    }
    return 0;
}