[带权并查集]How Many Answers Are Wrong

题目

题目链接

代码

#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<cctype>
#include<ctime>
#include<iostream>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include<set>
#include<vector>
#include<iomanip>
#include<list>
#include<bitset>
#include<sstream>
#include<fstream>
#include<complex>
#include<algorithm>
#if __cplusplus >= 201103L
#include <unordered_map>
#include <unordered_set>
#endif
#define ll long long
using namespace std;
const int INF = 0x3f3f3f3f;
int f[200010];
int sum[200010];
int find(int x){
	if(f[x]==x) return x;
	int tmp=f[x];
	f[x]=find(f[x]);	//先往下 
	sum[x]+=sum[tmp];
	return f[x];
}
int main(){
//	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	int n,m;
	while(scanf("%d%d",&n,&m)!=EOF){
		memset(sum,0,sizeof sum);
		for(int i=0;i<=n;i++) f[i]=i;
			int cnt=0;
		for(int i=1;i<=m;i++){
			int a,b,k;
			cin>>a>>b>>k;
			a--;
			int fa=find(a);
			int fb=find(b);
			if(fa!=fb){
				f[fb]=fa;
				sum[fb]=sum[a]+k-sum[b]; 
			}
			else{
				if(sum[b]-sum[a]!=k) cnt++;
			}
		}
		cout<<cnt<<endl;
	} 
    return 0;
}