HDU3047-Zjnu Stadium- Weighted disjoint-set

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.

InputThere 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.

OutputFor 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

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

 1 #include<stdio.h>
 2 #include<map>
 3 #include<iostream>
 4 #include<string.h>
 5 #include<algorithm>
 6 #include<stack>
 7 #include<cmath>
 8 #include<vector>
 9 using namespace std;
10 typedef long long ll;
11 const int N=50020;
12 
13 int f[N],d[N],n;
14 
15 void init()
16 {
17     for( Int I = . 1 ; I <= n-; I ++ )
 18 is      {
 . 19          F [I] = I;
 20 is          D [I] = 0 ;
 21 is      }
 22 is  }
 23 is  int GETF ( int X)
 24  {
 25      IF (F [X ] == X)
 26 is          return X;
 27      the else 
28      {
 29          int T = F [X]; // Get its parent 
30          F [X] = GETF (F [X]);
 31 is          D [X] = D [X] + D [T]; //D [x] (x is the distance from the root node) to update it to the distance of its parent from the root node of the parent + to 
32          return F [x];
 33 is      }
 34 is  }
 35  
36  void Merge ( int x, int Y)
 37 [  {
 38 is      int T1 = GETF (X);
 39      int T2 = GETF (Y);
 40      IF ! (T1 = T2)
 41 is          F [T2] = T1;
 42 is      return ;
 43 is  }
 44 is  
45  int main ()
 46 is  {
 47      int m, X, Y, Z;
 48      the while(~scanf("%d %d",&n,&m))
49     {
50         init();
51         int ans=0;
52         for(int i=0;i<m;i++)
53         {
54             scanf("%d %d %d",&x,&y,&z);
55             int fx=getf(x),fy=getf(y);
56             if(fx==fy)
57             {
58                 int w=d[y]-d[x];
59                 if(w!=z)
60                     ans++;
61             }
62             else
63             {
64                 merge(x,y); //f[fy]=x;
65                 d[fy]=d[x]+z-d[y];
66             }
67         }
68         cout<<ans<<endl;
69     }
70     return 0;
71 }