HDU 3038 How Many Answers Are Wrong

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
  
  

 

就是给你  n,m,    n个数，m给操作，a,b,c     表示a到b的和是c，如果通过以前的操作已知或者可以推出来a，b的值就判断该操作描述的正误，

输出错误的次数

并査集，解释在代码中

先说一个重要的地方   假如知道  a->b->c       d->e->f

输入   a,d,len

那么当函数cha（）找到c时，c->f  f时num[c]=-num[a]+len+num[d]; ; 自己好好体会吧；

在一个需要理解的地方就是cha（）函数中num[x]+=num[t];  一定要注意递归的顺序，拿上面例子来说当我们把c指向f时，

下一步cha（b）时就会更改num[b]为f到f的距离，并且father[b]=f;(好好想想吧)

过程就是住先改变父亲节点，后改变子节点（递归）

要说的已经说完了，还有一些细节在代码中

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

#define N  200005

int father[N],num[N];
int n,m;


int cha(int x)
{
    if(x!=father[x])
    {
        int t=father[x];  //先保存父亲节点
        father[x]=cha(father[x]);  
        num[x]+=num[t];  //等到父亲节点改变再改变此节点，重要的地方
    }
    return father[x];
}

int main()
{
    int i;
    int a,b,len;

    while(~scanf("%d%d",&n,&m))
    {
      for(i=0;i<=n;i++)
      {
          father[i]=i;
          num[i]=0;
      }

      int ans=0;
      while(m--)
      {
          scanf("%d%d%d",&a,&b,&len);
          a--;  //a到b的和等于0到b的和减去0到（a-1）的和

          int aa=cha(a);
          int bb=cha(b);
          if(aa!=bb)
          {
              father[bb]=aa;
              num[bb]=-num[b]+num[a]+len;//此步如上面解释，是一大重点
          }
          else
          {
              if(num[bb]!=(-num[b]+num[a]+len))
                ans++;
          }
      }
        printf("%d\n",ans);
    }
    return 0;
}

个人看法，应该是对的吧，如有错误(⊙o⊙)…欢迎指出，让我学习