poj2492 A Bug's Life（并查集）

和poj1703几乎一样，增加一个记录对立性别的属性opp，对于每一个给出的性别对立关系（u，v），每次合并（u，opp【v】），（v，opp【u】）；

合并后检查是否出现了u和opp【u】属于同一集合的情况。

Run ID	User	Problem	Result	Memory	Time	Language	Code Length	Submit Time
15880635	14110581002	2492	Accepted	188K	735MS	C++	1203B	2016-08-03 11:40:04

#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<queue>
#include<stack>
#include<cstring>
#include<map>
#include<string>
#include<climits>

#define maxn 110000
using namespace std;

int father[maxn];
int opp[maxn];
int _find(int x)
{
	int t=x;
	while(x!=father[x])
		x=father[x];
	while(t!=father[t])
	{
		int temp=t;
		t=father[t];
		father[temp]=x;
	}
	return x;
}

bool join(int x,int y)
{
	x=_find(x);
	y=_find(y);
	if(x!=y)
	{
		father[x]=y;
		return true;
	}
	return false;
}


int main()
{
	int T,I=1;
	scanf("%d",&T);
	while(T--)
	{
		int n,m;
		scanf("%d%d",&n,&m);
		for(int i=0;i<=n;++i)
		{
			father[i]=i;
			opp[i]=-1;
		}
		bool flag=true;
		for(int i=0;i<m;++i)
		{
			int u,v;
			scanf("%d%d",&u,&v);
			if(opp[u]==opp[v] && opp[u]==-1)
			{
				opp[u]=v;
				opp[v]=u;
			}
			else if(opp[u]==-1)
			{
				opp[u]=v;
				join(u,opp[v]);
			}
			else if(opp[v]==-1)
			{
				opp[v]=u;
				join(v,opp[u]);
			}
			else
			{
				join(u,opp[v]);
				join(v,opp[u]);
			}
			if(_find(u)==_find(v))
				flag=false;
		}
		printf("Scenario #%d:\n",I++);
		if(flag)
			printf("No suspicious bugs found!\n\n");
		else
			printf("Suspicious bugs found!\n\n");
	}
}