POJ 2492 A Bug's Life（种类并查集 + 偏移量）

题意：给了一些标号的虫子两两交配，看看有没有同性恋出现（这样说是不是有点变态— —！）

解题思路：并查集 + 偏移就行了，简单题，注意控制输出格式，不小心PE一次。

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.

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<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<cctype>
#include<list>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<vector>

using namespace std;

#define FOR(i, s, t) for(int i = (s) ; i <= (t) ; ++i)
#define REP(i, n) for(int i = 0 ; i < (n) ; ++i)

int buf[10];
inline long long read()
{
    long long x=0,f=1;
    char ch=getchar();
    while(ch<'0'||ch>'9')
    {
        if(ch=='-')f=-1;
        ch=getchar();
    }
    while(ch>='0'&&ch<='9')
    {
        x=x*10+ch-'0';
        ch=getchar();
    }
    return x*f;
}

inline void writenum(int i)
{
    int p = 0;
    if(i == 0) p++;
    else while(i)
        {
            buf[p++] = i % 10;
            i /= 10;
        }
    for(int j = p - 1 ; j >= 0 ; --j) putchar('0' + buf[j]);
}
/**************************************************************/
#define MAX_N 2500 * 2
const int INF = 0x3f3f3f3f;
int parent[MAX_N];

void init(int n)
{
    for(int i = 0 ; i < 2 * (n + 1) ; i++)
    {
        parent[i] = i;
    }
}

int find(int a)
{
    if(parent[a] != a)
    {
        parent[a] = find(parent[a]);
    }
    return parent[a];
}

void unite(int a, int b)
{
    int fa = find(a);
    int fb = find(b);
    if(fa == fb)
        return;
    parent[fb] = fa;
}

int same(int a, int b)
{
    return find(a) == find(b);
}

int main()
{
    int t = read();
    int cas = 1;
    while(t--)
    {
        int n = read();
        int m = read();
        init(n);
        int isbug = 0;
        for(int i = 0 ; i < m ; i++)
        {
            int x = read();
            int y = read();
            if(same(x, y))
            {
                isbug = 1;
            }
            unite(x, y + n);
            unite(x + n , y);
        }
        if(isbug)
        {
            printf("Scenario #%d:\nSuspicious bugs found!\n", cas++);
        }
        else
        {
            printf("Scenario #%d:\nNo suspicious bugs found!\n", cas++);
        }
        if(t) printf("\n");
    }

    return 0;
}