题目地址:http://acm.hdu.edu.cn/showproblem.php?pid=1829
代码如下:
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <string>
#include <vector>
#include <list>
#include <deque>
#include <queue>
#include <iterator>
#include <stack>
#include <map>
#include <set>
#include <algorithm>
#include <cctype>
using namespace std;
const int N=2011;
typedef long long LL;
int parent[N],xh[N];
int n,m;
void UFset()
{
for(int i=0;i<=n;i++)
parent[i]=i;
}
int find(int x)
{
int r=x;
while(r!=parent[r])
r=parent[r];
while(parent[x]!=r)
{
parent[x]=r;
x=parent[x];
}
return r;
}
void insert(int x,int y)
{
x=find(x);
y=find(y);
if(x==y)
return ;
parent[y]=x;
}
int main()
{
int i,j,a,b,T,xi=0;
cin>>T;
while(T--)
{
cin>>n>>m;
memset(xh,0,sizeof(xh));
int flag=0;
UFset();
while(m--)
{
scanf("%d%d",&a,&b);
if(flag) continue;
if(find(a)==find(b))
{
flag=1;continue;
}
if(xh[a]==0)
xh[a]=b;
else
insert(xh[a],b);
if(xh[b]==0)
xh[b]=a;
else
insert(xh[b],a);
}
printf("Scenario #%d:\n",++xi);
if(flag==0)
printf("No suspicious bugs found!\n\n");
else
printf("Suspicious bugs found!\n\n");
}
return 0;
}