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

**题意：**

给出一个区间的长度 N，及 M 个子区间和， 形如：x y z, 表示

子区间 [x, y] 的和为 z

如果一个“子区间和”与前面的“子区间和”冲突，即为错误。

求总错误个数。

**题解：**

带权并查集

我们可以以它的端点为点建立一个集合，他们的根就是能到达的最左端，如果都有相同的最左端那么就可以判断一下是否有矛盾产生。

https://www.cnblogs.com/liyinggang/p/5327055.html

**代码：**

```
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
int p[maxn];
int d[maxn];
int n, m;
int find(int x){
if(x != p[x]){
int t = find(p[x]);
d[x] += d[p[x]];
p[x] = t;
}
return p[x];
}
int main()
{
while(~scanf("%d%d",&n,&m)){
int cnt = 0;
for(int i = 0; i <= n; i ++){
p[i] = i;
d[i] = 0;
}
int a, b, v;
while(m --){
scanf("%d%d%d",&a,&b,&v);
a --;
int pa = find(a);
int pb = find(b);
if(pa == pb){
if(d[a] - d[b] != v) cnt ++;
}
else{
p[pa] = pb;
d[pa] = d[b] - d[a] + v;
}
}
printf("%d\n", cnt);
}
return 0;
}
```