Zjnu Stadium（带权并查集）

In 12th Zhejiang College Students Games 2007, there was a new stadium built in Zhejiang Normal University. It was a modern stadium which could hold thousands of people. The audience Seats made a circle. The total number of columns were 300 numbered 1–300, counted clockwise, we assume the number of rows were infinite.
These days, Busoniya want to hold a large-scale theatrical performance in this stadium. There will be N people go there numbered 1–N. Busoniya has Reserved several seats. To make it funny, he makes M requests for these seats: A B X, which means people numbered B must seat clockwise X distance from people numbered A. For example: A is in column 4th and X is 2, then B must in column 6th (6=4+2).
Now your task is to judge weather the request is correct or not. The rule of your judgement is easy: when a new request has conflicts against the foregoing ones then we define it as incorrect, otherwise it is correct. Please find out all the incorrect requests and count them as R.
Input
There are many test cases:
For every case:
The first line has two integer N(1<=N<=50,000), M(0<=M<=100,000),separated by a space.
Then M lines follow, each line has 3 integer A(1<=A<=N), B(1<=B<=N), X(0<=X<300) (A!=B), separated by a space.

Output
For every case:
Output R, represents the number of incorrect request.
Sample Input

10 10
1 2 150
3 4 200
1 5 270
2 6 200
6 5 80
4 7 150
8 9 100
4 8 50
1 7 100
9 2 100

Sample Output

2

翻译：
在2007年第十二届浙江省大学生运动会上，浙江师范大学新建了一座体育场。这是一个可以容纳数千人的现代化体育场。观众席围成一圈。列的总数是300，编号为1–300，顺时针计数，我们假设行的数量是无限的。
最近，布索尼娅想在这个体育场举行一场大型的戏剧表演。将有N个人去那里，人数是1——N。布索尼娅已经预订了好几个座位。为了搞笑，他对这些座位提出了M个要求：A B X，这意味着编号B的人必须顺时针坐X距离编号A的人。例如：A在第4列，X是2，那么B必须在第6列（6=4+2）。
现在你的任务是判断请求是否正确。你的判断规则很简单：当一个新请求与前面的冲突时，我们将其定义为不正确，否则它是正确的。请找出所有不正确的请求并将其计算为R。
输入
有许多测试用例：
每种情况：
第一行有两个整数N（1<=N<=50000），M（0<=M<=100000），用空格分隔。
接着是M行，每行有3个整数A（1<=A<=N）、B（1<=B<=N）、X（0<=X<300）（A！=B），用空格隔开。

输出
每种情况：
输出R，表示错误请求的数目。

带权并查集问题
我们可以开一个数组表示它距离自己的祖先的距离，因为一个队伍只有一个祖先，所以以祖先为原点，这样的话不是一对的肯定不会冲突，冲突的话肯定是一队的而且位置一样，或者这两个节点的距离和上次的不一样那么就是不合格的

代码：

#include"stdio.h"
int m,n,f[100010],v[100010];
int find(int x)
{
	if(x!=f[x])
	{
		int t=f[x];
		f[x]=find(t);
		v[x]=(v[t]+v[x])%300;//更新到祖先的距离
	}
	return f[x];
}
int merge(int a,int b,int x)
{
	int t1=find(a);
	int t2=find(b);
	if(t1!=t2)//祖先不同
	{
		f[t2]=t1;//更新祖先
		v[t2]=(v[a]-v[b]+x+300)%300;//相减可能为负值，所以要加300
	}
	else//祖先相同
	{
		if(v[b]!=(v[a]+x)%300)//位置不同，则此句错误
		return 1;
	} 
	return 0;
}
int main()
{
	while(~scanf("%d %d",&n,&m))
	{
		int a,b,x,s=0,i;
		for(i=1;i<=n;i++)
		{
			f[i]=i;
			v[i]=0;
		}
		while(m--)
		{
			scanf("%d %d %d",&a,&b,&x);
			s+=merge(a,b,x);
		}
		printf("%d\n",s);
	}
	return 0;
}