HDU3047 Zjnu Stadium

Problem Description

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

Hint:

（PS： the 5th and 10th requests are incorrect）

就是有一个环，给出多组关系满足a=b+x，判断不满足的有多少组

然后带权并查集维护一下，主义在合并两个并查集的时候差量的计算

 #include<bits/stdc++.h>

 using namespace std;

 #define N 50010

 int fa[N],dis[N];

 int n,m;

 int Find(int x){

     if(fa[x]==x)return x;

     int f=Find(fa[x]);

     dis[x]+=dis[fa[x]];

     return fa[x]=f;

 }

 void init(){for(int i=;i<=n;i++)fa[i]=i,dis[i]=;}

 int main(){

     while(scanf("%d%d",&n,&m)!=EOF){

         init();

         int res=;

         while(m--){

             int a,b,x;

             scanf("%d%d%d",&a,&b,&x);

             int f_a=Find(a);

             int f_b=Find(b);

             if(f_a==f_b){

                 if(dis[a]+x!=dis[b])res++;

                 continue;

             }

             dis[f_b]=dis[a]-dis[b]+x;

             fa[f_b]=f_a;

         }

         printf("%d\n",res);

     }

     return ;

 }