90pts求调

#include<bits/stdc++.h>
using namespace std;
const int MAXN = 50005;
int n,ans = 0;
int f[MAXN*3];
void init(){
	for(int i = 1;i <= MAXN;i++){
		f[i] = i;
	}
	for(int i = MAXN;i <= 2*MAXN;i++){
		f[i] = i-MAXN;
	}
	for(int i = 2*MAXN;i <= 3*MAXN;i++){
		f[i] = i-2*MAXN;
	}
}
int find(int x){
	if(f[x] == x){
		return x;
	}
	else{
		f[x] = find(f[x]);
		return f[x];
	}
}
void same(int x,int y){
	if(find(x) == find(y+n) || find(x+n) == find(y+2*n) || find(x+2*n) == find(y)){
		ans ++;
		return;
	}
	if(find(y) == find(x+n) || find(y+n) == find(x+2*n) || find(y+2*n) == find(x)){
		ans ++;
		return;
	}
	f[find(x)] = find(y);
	f[find(x+n)] = find(y+n);
	f[find(x+2*n)] = find(y+2*n);
}
void eat(int x,int y){
	if(find(x) == find(y) || find(x+n) == find(y+n) || find(x+2*n) == find(y+2*n)){
		ans ++;
		return;
	}
	if(find(y) == find(x+n) || find(y+n) == find(x+2*n) || find(y+2*n) == find(x)){
		ans ++;
		return;
	}
	f[find(x)] = find(y+n);
	f[find(x+n)] = find(y+2*n);
	f[find(x+2*n)] = find(y);
}
int main(){
	int k;
	cin >> n >> k;
	init();
	for(int i = 1;i <= k;i++){
		int p,x,y;
		cin >> p >> x >> y;
		if(x > n || y > n){
			ans ++;
			continue;
		}
		if(p == 1){
			same(x,y);
		}
		if(p == 2){
			eat(x,y);
		}
	}
	cout << ans;
	return 0;
}