杭电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): 2779    Accepted Submission(s): 1064

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 

/*
经典题目，，，就是，，有点不太好理解，可以画一个有向图辅助理解比如3--5 w=8 2--4 w=6 4--5 w=9 链接3-->5权值为8 反向权值为负 2-->4权值为6 输入第三组的时候是要求把4的根节点2连接到5的根节点3上边，从2出发到3的权值就能可以看到是val[u]-val[v]+w
加油！！！
Time:2015-1-10 17:09
*/
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long LL;
const int MAX=200000+10;
int father[MAX];
LL val[MAX];
int find(int x){
    if(father[x]==-1)return x;
    int temp=find(father[x]);
    val[x]+=val[father[x]];
    return father[x]=temp;
}
int main(){
    int n,m;
    while(scanf("%d%d",&n,&m)!=EOF){
        memset(father,-1,sizeof(father));
        memset(val,0,sizeof(val));
        int u,v,w;
        int ans=0;
        while(m--){
            scanf("%d%d%d",&u,&v,&w);
            u=u-1;
            int t1=find(u);
            int t2=find(v);
            if(t1!=t2){
                father[t2]=t1;
                val[t2]=val[u]-val[v]+(LL)w;
            //2--5 w=7  3--4 w=8  注意：可以画一个有向图去辅助判断
            //输入 4--5 w=9 将2接到3上  val[2]=val[4]-val[5]+w
            /*这儿不太好理解。较小的位置的父节点 u val[u]-val[v] 为未连接前差值
            val[v]的权值就是val[v]与根节点的差值两节点val的差值就是根节点未确定关系时
            在各自区域内应该有的差值，因为刚开始权值都是初始化为0，每个集合都是从0开始往下加权值的，
            再加上输入的差值w就是确定关系后的差值
            */
            }else{
                if(val[v]-val[u]!=w)ans++;
            }
        }
        printf("%d\n",ans);
    }
return 0;
}