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): 3146    Accepted Submission(s): 1202

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

 

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

题目分析:
利用并查集形成集合树,利用sum数组记录集合树中当前节点i到根之间的边的权值和,如果当前两个节点不在同一棵集合树中,那么通过两个集合树合并,调整权值,使能够保证合法的,所以只需要合并,将一棵树的根变为另一棵树的根的子节点,然后建边,因为f[i]<i,i<j,f[j]<j,所以s=sum[j]+sum[f[j]]-sum[i]因为当前j的根是f[j],所以要加上新加的边权,那么新的边权既可以通过这个方程求取即可

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#define N 200007
#define M 40007

using namespace std;

int n,m;
int a,b,s;
int fa[N],sum[N];

void init  ( int n )
{
    memset ( sum , 0 , sizeof ( sum ) );
    for ( int i = 1 ; i <= n ; i++ )
        fa[i] = i;
}

int find ( int x )
{
    if ( fa[x] == x ) return x;
    else
    {
        int temp = find ( fa[x] );
        sum[x] += sum[fa[x]];
        return fa[x] = temp;
    }
}

int main ( )
{
    while ( ~scanf ( "%d%d" , &n , &m ) )
    {
        init(n);
        int cnt = 0;
        for ( int i = 1 ; i <= m ; i++ )
        {
            scanf ( "%d%d%d" , &a, &b, &s );
            a--;
            int x = find ( a );
            int y = find ( b );
            if ( x == y )
            {
                if ( sum[b]-sum[a] != s ) cnt++;
            }
            else 
            {
                fa[y] = x;
                sum[y] = sum[a]-sum[b]+s;
            }
        }
        printf ( "%d\n" , cnt );
    }
}