求救

#include<bits/stdc++.h>
using namespace std;
int fa[50005],d[50005];
int m,n;
int get(int x){
	if(x==fa[x]){
		return x;
	}
	int a=get(fa[x]);
	d[x]+=d[fa[x]];
	d[x]%=3;
	fa[x]=a;
	return a;
}
void merge(int x,int y,int n){
	int a=get(x),b=get(y);
	d[a]+=(d[y]-d[x]+3+n)%3;
	fa[a]=b;
}
int main(){
	int n,m,ans=0;
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++){
		fa[i]=i;
		d[i]=0;
	}
	for(int i=1;i<=m;i++){
		int q,x,y;
		scanf("%d%d%d",&q,&x,&y);
		if(x<0||x>n||y<0||y>n||(q==2&&x==y)){
			ans++;
			continue;
		}
		if(q==1){
			if(get(x)==get(y)&&d[x]%3!=d[y]%3){
				ans++;
				continue;
			}
			else if(get(x)!=get(y)){
				merge(x,y,0);
			}	
		}
		else{
			if(get(x)==get(y)&&(d[x]%3!=(d[y]+2)%3)){
				ans++;
				//cout<<"b";
				continue;
			}
			else if(get(x)!=get(y)){
				merge(x,y,1);
			}
			//merge(x,y,1);
			//cout<<"a";
		}
	}
	//for(int i=1;i<=n;i++){
	//	cout<<i<<' '<<d[i]<<endl;
	//}
	cout<<ans<<endl;
	return 0;
}