求助带权并查集

#include<bits/stdc++.h>
using namespace std;

const int maxn=5e4+10;

const int mod=3;

int fa[maxn],w[maxn];

int Find(int u) {
	if(fa[u]) {
		fa[u]=Find(fa[u]);
		w[u]=(w[fa[u]]+w[u]+mod)%mod;
		return fa[u];
	}
	return u;
}

void Merge(int u,int v,int c) {
	int fu=Find(u),fv=Find(v);
	fa[fu]=fv;
	w[u]=c;
}

int main() {
	int n,T,cnt=0;
	cin>>n>>T;
	while(T--) {
		int op,u,v,f=1;
		cin>>op>>u>>v;
		if(u>n||v>n||(op==2&&u==v)) {	
			cnt++;
			f=0;
			continue;
		}else 
		if(op==1) {
			if(Find(u)==Find(v)&&w[u]!=w[v]) {
				cnt++;
				f=0;
			}else if(Find(u)!=Find(v)) {
				Merge(Find(v),Find(u),(w[u]-w[v]+mod)%mod);
			}
		}else {
			if(Find(u)==Find(v)) {
				if(w[u]!=(w[v]-1+mod)%mod) {
					cnt++;
					f=0;
				}
			}else {
				Merge(Find(v),Find(u),(w[u]-w[v]+1+mod)%mod);
			}
		}
//		cout<<(f?"T\n":"F\n");
	}
	cout<<cnt;
}