POJ A Bug's Life

Description

Input

Output

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!

#include<cstdio>
#include<cstdlib>
#include<cstring>
using namespace std;
int father[2010],pre[2010];
int find(int x){
	return x==father[x]?x:father[x]=find(father[x]);
}
int main()
{
	int t,k=1,m,n,i;
	scanf("%d",&t);
	while(t--){
		scanf("%d%d",&n,&m);
		for(i=1;i<=n;++i){
			father[i]=i;
			pre[i]=0;
		}
		int flag=0,a,b,c,d;
		for(i=0;i<m;++i){
			scanf("%d%d",&a,&b);
			if(find(a)==find(b))flag=1;
			c=pre[a];d=pre[b];
			if(c){
				c=find(c);b=find(b);
				if(c!=b)father[c]=b;
			}
			if(d){
				d=find(d);a=find(a);
				if(d!=a)father[a]=d;
			}
			pre[a]=b;pre[b]=a;
		}
		printf("Scenario #%d:\n",k++);
		if(flag)
		printf("Suspicious bugs found!\n");
		else 
		printf("No suspicious bugs found!\n");
		printf("\n");
	}
	return 0;
}