向量：

#include<iostream>
using namespace std;
const int N = 50010;
int d[N], father[N];
int n, k;
int find(int x){
	if (x == father[x])return x;
	int root = find(father[x]);
	d[x] = (d[x] + d[father[x]]) % 3;
	return father[x] = root;
}
int main(){
	cin >> n >> k;
	for (int i = 0; i <= n; i++){
		father[i] = i;
	}
	int res=0;
	for (int i = 0; i < k; i++){
		int opt, a, b;
		cin >> opt >> a >> b;
		if (a>n || b > n){
			res++;
			continue;
		}
		else if (opt == 2 && a == b){
			res++;
			continue;
		}
		else{
			int x = find(a); int y = find(b);
			if (x == y){
				if ((((d[a] - d[b])%3)+3) % 3 != (opt - 1)){
					res++;
				}
			}
			else{
				father[x] = y;
				d[x] = ((d[b] + opt - 1 - d[a]) +3)% 3;
			}
		}
	}
	cout << res << endl;
	return 0;
}