# HDOJ3047 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

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

#include <cstdio>
#include <algorithm>
#include <cstring>
#define MAXN 50010
using namespace std;
int const MOD = 300;
int n,m;
int pre[MAXN]; // 父亲节点
int weight[MAXN];  // 边权

// 查找祖先节点(路径压缩)
int Find(int x) {
if(pre[x] == x) {
return x;
}
int father = Find(pre[x]);
weight[x] = (weight[x] + weight[pre[x]]) % MOD;
pre[x] = father;// 路径压缩
return father;
}

// 合并节点,返回值：是否是真票(y->x权值为w)
bool Union(int x,int y,int w) {
int xx = Find(x);
int yy = Find(y);
if(xx == yy) {
int t = (weight[y] - weight[x] + MOD) % MOD;// y到x的权值
return t == w;
}
// 没有公共祖先
pre[yy] = xx;
//weight[yy] + weight[y] - weight[x] = w;
weight[yy] = (weight[x] - weight[y] + w + MOD) % MOD; // 更新权值
return true;
}

// 初始化
void Init() {
for(int i = 1;i <= n;i++) {
pre[i] = i;
}
memset(weight,0,sizeof(weight));
}
int main()
{
while(scanf("%d%d",&n,&m) != EOF) {
Init();
int x,y,w;
bool result;
int cnt = 0;
for(int i = 0;i < m;i++) {
scanf("%d%d%d",&x,&y,&w);
result = Union(x,y,w);
if(!result) cnt++; //假票
}
printf("%d\n",cnt);
}

return 0;
} 

• 广告
• 抄袭
• 版权
• 政治
• 色情
• 无意义
• 其他

120