*HDU1829 并查集

A Bug's Life

Time Limit: 15000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 14121    Accepted Submission(s): 4603

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!

 

 

题意：

有若干bugs，一对一对的给出，判断其中是否有同性恋，如果1与2,2与3,1又与3，就说明1和3是gay.

代码：

 //将相同性别的bugs放进同一并查集里，这样只要输入的两个bug有相同的根就是gay.
 //路径压缩的while 的find比递归的find稍快一些。
 #include<iostream>
 #include<cstdio>
 #include<cstring>
 using namespace std;
 int t,n,m;
 int fat[],sex[];
 int find(int x)
 {
     int rt=x;
     while(fat[rt]!=rt)
     rt=fat[rt];
     int i=x,j;
     while(i!=rt)
     {
         j=fat[i];
         fat[i]=rt;
         i=j;
     }
     return rt;
 }
 /*int find(int x)
 {
     if(fat[x]!=x)
     fat[x]=find(fat[x]);
     return fat[x];
 }*/
 void connect(int x,int y)
 {
     int xx=find(x),yy=find(y);
     if(xx!=yy)
     fat[xx]=yy;
 }
 int main()
 {
     int a,b;
     scanf("%d",&t);
     for(int k=;k<=t;k++)
     {
         scanf("%d%d",&n,&m);
         for(int i=;i<=n;i++)
         {
             fat[i]=i;
             sex[i]=;
         }
         bool flag=;
         for(int i=;i<=m;i++)
         {
             scanf("%d%d",&a,&b);
             if(flag) continue;
             if(find(a)==find(b))
             {
                 flag=;
                 continue;
             }
             if(sex[a]==) sex[a]=b;
             else connect(sex[a],b);
             if(sex[b]==) sex[b]=a;
             else connect(sex[b],a);
         }
         printf("Scenario #%d:\n",k);
         if(flag) printf("Suspicious bugs found!\n");
         else printf("No suspicious bugs found!\n");
         printf("\n");
     }
     return ;
 }