5.1.1 A Bug's Life

A Bug's Life

Time Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 425 Accepted Submission(s): 159

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

思路：并查集，我对并查集本来就不熟，这次算是很全面的了解了

/*
ID:wuhuaju2
PROG:
LANG:C++
*/
#include <cstdio>
#include <iostream>
#include <cstdlib>
#include <algorithm>
#include <cstring>
#include <string>
using namespace std;

const int maxn=2010;
int f[maxn],r[maxn];
int T,n,m,f1,f2,x,y;
bool flag=false;

void close()
{
    exit(0);
}

void work()
{
}

int find(int k)
{
    if (k==f[k])
        return k;
    int t=f[k];
    f[k]=find(f[k]);
    r[k]=(r[k]+r[t]+1) % 2;
    return f[k];
}

void init ()
{
   scanf("%d",&T);
    int cnt=0;
    while (T--)
    {
        flag=false;
        cnt++;
        scanf("%d %d",&n,&m);
        for (int i=0;i<=n;i++)
        {
            f[i]=i;
            r[i]=1;
        }
        for (int i=1;i<=m;i++)
        {
            scanf("%d %d",&x,&y);
            f1=find(x);
            f2=find(y);
               if (f1==f2 && r[x]==r[y])
                {
                    flag=true;
            //        break;
                }
                    f[f1]=f2;
            r[f1]=(r[x]+r[y])%2;
        }
    //    union_set();
   printf("Scenario #%d:\n",cnt);
    if (flag) printf("Suspicious bugs found!\n\n");
    else printf("No suspicious bugs found!\n\n");
    }
}

int main ()
{
    init();
    work();
    close();
    return 0;
}