HDU 1829 A Bug's Life

A Bug's Life

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

23 31 22 31 34 21 23 4

 

Sample Output

Scenario #1:Suspicious bugs found!Scenario #2:No suspicious bugs found!
Hint
Huge input,scanf is recommended.

题意：有一堆虫子，不知道它们是否分为两种性别，所以根据它们活动判断是否为两种性别，输入两个表示这两个虫子之间有性行为。

就是判断是否为二分图，用的是并查集的方法。

#include <cstdio>#include <cstring>#include <algorithm>#define inf 0xfffffff#define N 1000000using namespace std;int f[N],h[N];bool a;int find(int x){    if(f[x]==x)        return x;    else        return f[x]=find(f[x]);}void unify(int x,int y){    x=find(x),y=find(y);    if(x==y)    {        a=1;        return;    }    if(h[x])        f[h[x]]=y;    if(h[y])        f[h[y]]=x;    h[x]=y;    h[y]=x;}int main(){    int T;    scanf("%d",&T);    int e=1;    while(T--)    {        int n,m,j,k;        scanf("%d%d",&n,&m);        for(int i=1; i<=n; i++)            f[i]=i,h[i]=0;            a=0;        for(int i=1; i<=m; i++)        {            scanf("%d%d",&j,&k);            unify(j,k);        }        printf("Scenario #%d:\n",e++);        if(a==0)            puts("No suspicious bugs found!");        else            puts("Suspicious bugs found!");        printf("\n");    }    return 0;}