POJ-2492（并查集问题）

A Bug's Life
Time Limit: 10000MS Memory Limit: 65536KB 64bit IO Format: %I64d & %I64u
Submit
 
Status


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.
Source

TUD Programming Contest 2005, Darmstadt, Germany

单纯的并查集问题，只要分好类就OK了。

#include <cstdio>
#include <iostream>
#include <cmath>
#include <algorithm>

using namespace std;
int x[1003000];
int y[1003000];
int find(int p)
{
    if (p==x[p])
    {
        return p;
    }
    else
        return x[p]=find(x[p]);
}
void unit(int p,int q)
{
    p=find(p);
    q=find(q);
    if (p==q)
        return ;
    else
    {
        x[p]=q;
    }
}
int main()
{
       int Count;
       int sum=1;
        scanf("%d",&Count);
        int m,n;
        for (int num=0;num<Count;num++)
        {
        scanf("%d",&m);
        scanf("%d",&n);
        for (int number1=0;number1<2*m;number1++)
        {
            x[number1]=number1;
        }
        int p,q;
        int flag=0;
        for (int number1=0;number1<n;number1++)
        {
        scanf("%d %d",&p,&q);
        p=p-1;
        q=q-1;
        if (p>=m&&p<0||q>=m&&q<0)
        {
            flag=1;
        }
        if (find(p)==find(q))
        {
            flag=1;
        }
        else
        {
         unit(p,q+m);
        unit(p+m,q);
        }

        }
        if (flag==1)
        {
            printf("Scenario #%d:\nSuspicious bugs found!\n",sum);
        }
        else
        {
            printf("Scenario #%d:\nNo suspicious bugs found!\n",sum);
        }
        if (num<Count-1)
        {
            printf("\n");
        }
        sum++;
        }
    return 0;
}