POJ 1182 食物链 G++ 并查集 背

#include <iostream>
#include <cstdio> 
using namespace std;
//挑战程序设计竞赛 并查集 背
//0 n-1 +n
int fa[160000];
int find(int x)
{
	if(x==fa[x])
	{
		return x;
	}else
	{
		return fa[x]=find(fa[x]);
	}
}
int main() 
{
	int N,K;
	scanf("%d%d",&N,&K);
	//cin>>N>>K;
	for(int i=0;i<=N*3;i++)
	{
		fa[i]=i;
	}
	int jg=0;
	for(int o=0;o<K;o++)
	{
		int com,x,y;
		scanf("%d%d%d",&com,&x,&y);
		//cin>>com>>x>>y;
		if(x>N || y>N || x<=0 || y<=0 )
		{
			jg++;
		}else
		{
			if(com==1)//同类 
			{
				if(find(x)==find(y+N) ||  find(y)==find(x+N) )//抄书 去除多余  x吃y  y吃x 
				{
					jg++;
				}else
				{
					fa[find(x)]=find(y);
					fa[find(x+N)]=find(y+N);
					fa[find(x+2*N)]=find(y+2*N); 
				} 
			}else if(com==2)//x吃y 
			{
				if(x==y)
				{
					jg++;
				}else
				{
					if(find(x)==find(y) ||find(y)==find(x+N) )//抄书 同类   y吃x 
					{
						jg++;
					}else
					{
						fa[find(x)]=find(y+N);
						fa[find(x+N)]=find(y+2*N);
						fa[find(x+2*N)]=find(y);
					}				
				}
	
			}			
		}
		//cout<<jg<<endl;
	}
	printf("%d\n",jg);
	//cout<<jg<<endl;
	return 0;
}