专题四 Problem S

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!

思路：

假设有1，2   2，3          即1--2--3， 明显相邻的两个不能是同性别的，如果相邻两个是同性的，那么说明就可能是有同性恋存在。

ac代码：

#include  
#define N 2005  
using namespace std;  
int f[N],rank[N], n, k;  
bool flag;  
  
inline void init(){  
    flag=false;  
    for(int i=0; i<=n; ++i)  
        f[i]=i, rank[i]=0;  
}  
int find(int x){  
    if(x==f[x])return f[x];  
    int t=find(f[x]);  
    rank[x] = (rank[f[x]]+rank[x])&1;  
    f[x]=t;  
    return f[x];  
}  
void Union(int x, int y){  
    int a=find(x), b=find(y);  
    if(a==b){  
        if(rank[x]==rank[y])  
            flag=true;  
        return;  
    }  
    f[a]=b;  
    rank[a] = (rank[x]+rank[y]+1)&1;  
}  
  
  
int main(){  
    int T,a,b,cas=1;  
    scanf("%d",&T);  
    while(T--){  
        scanf("%d%d",&n,&k);  
        init();  
        for(int i=0; i             scanf("%d%d",&a,&b);  
            if(flag)continue;  
            Union(a,b);  
        }  
        printf("Scenario #%d:\n",cas++);  
        if(flag)printf("Suspicious bugs found!\n");  
        else printf("No suspicious bugs found!\n");  
        printf("\n");  
    }  
    return 0;  
}