hdu3038How Many Answers Are Wrong

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int p[300005],w[300005];
int n,m,a,b,c;
void init()
{
	for(int i=0;i<300005;i++)
	{p[i]=i;w[i]=0;}
}
int find(int x)
{
	if(x==p[x]) return x;
	int tmp=find(p[x]);
	w[x]+=w[p[x]];
	p[x]=tmp;
	return p[x];
}
void combine(int a,int b)
{
	int t1=find(a);
	int t2=find(b);
	p[t2]=t1;
	w[t2]=w[a]-w[b]+c;
}
int main()
{
	int i,j,k,sum,zhi;
	while(scanf("%d%d",&n,&m)!=EOF)
	{
		sum=0;init();k=m;
		while(m--)
		{
			scanf("%d%d%d",&a,&b,&c);
			a--;
			if(find(a)==find(b)&&(w[b]-w[a])!=c) sum++;
			else
			combine(a,b);
		}
		printf("%d\n",sum);
	}
	return 0;
}