poj 1182

#include<iostream>
#include<algorithm>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<string>
#include<vector>
#include<queue>
#include<list>
using namespace std;
typedef long long lld;
typedef unsigned int ud;
#define Inf INT_MAX/2//int最大
#define Min(x,y) (x)<(y)?(x):(y)
#define Max(x,y) (x)>(y)?(x):(y)
#define MemsetMax(a) memset(a,100,sizeof a)
#define MemsetZero(a) memset(a,0,sizeof a)
#define MemsetMin(a) memset(a,-1,sizeof a)
#define PQ priority_queue
#define Q queue
#define N 50002
#define M 100002
int n,m;
int parent[N],r[N];

void InitParent()
{
	for(int i=0;i<=n;i++)
	{
		parent[i]=i;
		r[i]=0;
	}
}

int find(int x){
	if(x==parent[x])
		return x;
	int f=parent[x];
	parent[x]=find(parent[x]);
	r[x]=(r[x]+r[f])%3;
	return parent[x];
}

void merge(int a,int b,int d)
{
	int fa=find(a);
	int fb=find(b);
	parent[fb]=fa;
	r[fb]=(r[a]-r[b]+3+(d-1))%3;
}

int main()
{
	scanf("%d%d",&n,&m);
		int sum=0;
		InitParent();
		for(int i=1;i<=m;i++)
		{
			int a,b,d;
			scanf("%d%d%d",&d,&a,&b);
			if(a>n||b>n||(d==2&&a==b))
				sum++;
			else if(find(a)==find(b))
			{
				if(d==1&&(r[a]!=r[b]))
					sum++;
				else if(d==2&&((r[a]+1)%3!=r[b]))
					sum++;
			}
			else
				merge(a,b,d);
		}
		printf("%d\n",sum);
	return 0;
}