HDU 3038 How Many Answers Are Wrong（带权并查集）

How Many Answers Are Wrong

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 21260    Accepted Submission(s): 7330

Problem Description

TT and FF are ... friends. Uh... very very good friends -________-b

FF is a bad boy, he is always wooing TT to play the following game with him. This is a very humdrum game. To begin with, TT should write down a sequence of integers-_-!!(bored).

Then, FF can choose a continuous subsequence from it(for example the subsequence from the third to the fifth integer inclusively). After that, FF will ask TT what the sum of the subsequence he chose is. The next, TT will answer FF's question. Then, FF can redo this process. In the end, FF must work out the entire sequence of integers.

Boring~~Boring~~a very very boring game!!! TT doesn't want to play with FF at all. To punish FF, she often tells FF the wrong answers on purpose.

The bad boy is not a fool man. FF detects some answers are incompatible. Of course, these contradictions make it difficult to calculate the sequence.

However, TT is a nice and lovely girl. She doesn't have the heart to be hard on FF. To save time, she guarantees that the answers are all right if there is no logical mistakes indeed.

What's more, if FF finds an answer to be wrong, he will ignore it when judging next answers.

But there will be so many questions that poor FF can't make sure whether the current answer is right or wrong in a moment. So he decides to write a program to help him with this matter. The program will receive a series of questions from FF together with the answers FF has received from TT. The aim of this program is to find how many answers are wrong. Only by ignoring the wrong answers can FF work out the entire sequence of integers. Poor FF has no time to do this job. And now he is asking for your help~(Why asking trouble for himself~~Bad boy)

Input

Line 1: Two integers, N and M (1 <= N <= 200000, 1 <= M <= 40000). Means TT wrote N integers and FF asked her M questions.

Line 2..M+1: Line i+1 contains three integer: Ai, Bi and Si. Means TT answered FF that the sum from Ai to Bi is Si. It's guaranteed that 0 < Ai <= Bi <= N.

You can assume that any sum of subsequence is fit in 32-bit integer.

Output

A single line with a integer denotes how many answers are wrong.

Sample Input

10 5

1 10 100

7 10 28

1 3 32

4 6 41

6 6 1

Sample Output

1

Source

2009 Multi-University Training Contest 13 - Host by HIT

带权并查集讲解

题意：有N个数，M个区间和信息，问有多少个区间和信息和之前的矛盾。

方法：产生矛盾的情况是：某个区间的值可以由前边的区间求出来，而后来又给出了这个区间错误的值。如果给定区间的两个端点属于同一个并查集，判断这个区间的值是否与计算得到的值相等；如果给定区间的两个端点不属于同一个并查集，将这两个并查集合并。并查集边的权值就等于题干中的区间和。sum[i]数组存的是 i点到根的和

还有要注意是多组输入。。。

//程序的目的是找错误答案的数目
#include <bits/stdc++.h>
#define Max 200005
using namespace std;
int n, m;
int fa[Max];
int sum[Max]; //指的是当前结点到父结点的和
int x, y, z;
void init() {
    for(int i = 0; i <= n; i++) {
        fa[i] = i;
        sum[i] = 0;
    }
}
//查找父结点
int Find(int x) {
    //如果x不是所在子树的根节点的直接孩子
    while(fa[x] != fa[fa[x]]) {
        sum[x] = sum[x] + sum[fa[x]];
        fa[x] = fa[fa[x]];
        //对其父结点到期爷爷节点之间的路径进行压缩
    }
    return fa[x];
}
//合并节点
void mix(int x,int y,int val) {
    int fx = Find(x);
    int fy = Find(y);
    if(fx == fy) return ;
    fa[fx] = fy;
    sum[fx] = -sum[x] + sum[y] + val; 
}
int main() {
    ios::sync_with_stdio(false);

    while(cin >> n >> m){
        int ans = 0;
        init();
        for(int i = 0; i < m; i++) {
            cin >> x >> y >> z;
            x--;
            int fx = Find(x);
            int fy = Find(y);
            if(fx == fy) {
                if ((z+sum[y]) != sum[x])
                    ans++;
            }else {
                mix(x, y, z);
            }
            // for(int i = 1; i <= n; i++) {
            //     if(sum[i]==0) continue;
            //     cout <<i<< ":--> " << sum[i] << endl;
            // }
        }
        cout << ans << endl;
    }

    return 0;
}
/*
10 5
1 10 100
7 10 28
1 3 32
4 6 41
6 6 1
*/