Time Limit: 10000MS | Memory Limit: 65536K | |
Total Submissions: 20235 | Accepted: 6578 |
Description
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
Output
#include<stdio.h>
#include<string.h>
#define clear(a,b) memset(a,b,sizeof(a))
#define maxn 200000
int t,k,fa[maxn],enemy[maxn];
int getfa(int a)
{
if (fa[a] == a) return a;
else fa[a] = getfa(fa[a]);
return fa[a];
}
int judge(int a,int b)
{
return getfa(a) == getfa(b);
}
void unite(int a,int b)
{
fa[getfa(b)] = getfa(a);
}
void work()
{
int m,n,i,b,a;
char ch;
clear(enemy,0);
scanf("%d%d",&n,&m);
for(i = 1;i <= n;i++) fa[i] = i;
for(i = 1;i <= m;i++) {
scanf("%d%d",&a,&b);
if (judge(a,b)) {
int temp = m - i;
while (temp--) scanf("%d%d",&a,&b);
printf("Scenario #%d:\nSuspicious bugs found!\n",k);
return ;
}
if (enemy[a]) unite(enemy[a],b);
if (enemy[b]) unite(enemy[b],a);
enemy[a] = b;
enemy[b] = a;
}
printf("Scenario #%d:\nNo suspicious bugs found!\n",k);
return ;
}
int main()
{
scanf("%d",&t);
for(k = 1;k <= t;k++) {work();if(k < t)printf("\n");}
return 0;
}