参考值题解:http://blog.csdn.net/ditian1027/article/details/20804911
http://blog.csdn.net/c0de4fun/article/details/7318642/
#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<math.h>
#include<functional>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
const int maxn = 50005;
const int inf = 1<<29;
int n,k;
int p[maxn],r[maxn]; //存与父节点的关系 0 同一类,1被父节点吃,2吃父节点
int find( int x )
{
if( p[x] == x ) return x;
int tmp = p[x];
p[x] = find(p[x]);
r[x] = (r[x]+r[tmp])%3;
return p[x];
}
void merge( int d,int x,int y )
{
int fx = find(x);
int fy = find(y);
p[fy] = fx;
r[fy] = ( r[x] + (( 3 - r[y] ) + (d-1)) )%3;
// d-1表示x,y间的关系 3-r[y]表示y的父节点关系 (( 3 - r[y] ) + (d-1))表示y的父节点与x的关系
}
void init()
{
for( int i = 0; i <= n; i ++ ){
p[i] = i;
r[i] = 0;
}
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("data.txt","r",stdin);
#endif
int d,x,y;
scanf("%d%d",&n,&k);
init();
int ans = 0;
for( int i = 0; i < k; i ++ ){
scanf("%d%d%d",&d,&x,&y);
if( x > n || y > n || ( d== 2 && x == y ) ) ans ++;
else if( find(x) == find(y) ){
if( d == 1 && r[x] != r[y] ) ans ++;
else if( d == 2 && (r[x]+1)%3 != r[y] ) ans ++; // 如果 x 没有吃 y (注意要对应Uinon(x, y)的情况,否则一路WA到死啊!!!)
}
else
merge( d,x,y );
}
printf("%d\n",ans);
return 0;
}