直接建立2*n的并查集,如果x和y没有连着就把(x+n)和y连起来,x和(y+n)连起来,反之就是有错误,一定记住要把数据输完,wa了好久发现这个问题。。。
#include<iostream>
#include<cstdio>
#include<cstring>
#include<ctime>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<set>
#include<bitset>
#include<map>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#define INF 0x3f3f3f3f
#define inf 2*0x3f3f3f3f
#define llinf 1000000000000000000
#define pi acos(-1.0)
#define mod 1000000007
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define lrt rt<<1
#define rrt rt<<1|1
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define per(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define mem(a,b) memset(a,b,sizeof(a))
#define lb(x) (x&-x)
#define gi(x) scanf("%d",&x)
#define gi2(x,y) scanf("%d%d",&x,&y)
#define gll(x) scanf("%lld",&x)
#define gll2(x,y) scanf("%lld%lld",&x,&y)
#define gc(x) scanf("%c",&x)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int>P;
/***********************************************/
int par[4005],ranks[4005],t,n,m,x,y;
void init(int n)
{
rep(i,0,n)par[i]=i,ranks[i]=0;
}
int finds(int x)
{
if(par[x]==x)return x;
return par[x]=finds(par[x]);
}
void unite(int x,int y)
{
x=finds(x);y=finds(y);
if(ranks[x]>ranks[y])par[y]=x;
else par[x]=y;
if(ranks[x]==ranks[y])ranks[y]++;
}
bool same(int x,int y)
{
return finds(x)==finds(y);
}
int main()
{
gi(t);
rep(cas,1,t+1)
{
printf("Scenario #%d:\n",cas);
gi2(n,m);
init(2*n);
int flag=0;
while(m--)
{
gi2(x,y);x--,y--;
if(!flag&&same(x,y))flag=1;
else unite(x,y+n),unite(x+n,y);
}
if(!flag)printf("No suspicious bugs found!\n");
else printf("Suspicious bugs found!\n");
printf("\n");
}
return 0;
}