How Many Answers Are Wrong (带权的并查集)
来源:互联网 发布:php.ini在哪 编辑:程序博客网 时间:2024/06/06 03:11
How Many Answers Are Wrong
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 652 Accepted Submission(s): 293Problem 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)
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.
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 51 10 1007 10 281 3 324 6 416 6 1
Sample Output
1
Source
2009 Multi-University Training Contest 13 - Host by HIT
#include <stdio.h>#include <iostream>#include <algorithm>#include <cmath>#include <vector>#include <string.h>using namespace std;const int MAX = 200005;int n, m;int pre[MAX];int value[MAX];inline void init() { for (int i = 0; i <= n; ++i) { pre[i] = i; value[i] = 0; }}int find(int x) { if (x == pre[x]) return x; int temp = find(pre[x]);// 爷爷。 父 当前 value[x] += value[pre[x]];// |_______|________| return pre[x] = temp;// 通过回溯来更新父节点的值,以致更新到当前点的值。}int main() { int a, b, c; while (cin >> n >> m) { init(); int ans = 0; for (int i = 0; i < m; ++i) { cin >> a >> b >> c; a--; int ra = find(a); int rb = find(b); if (ra != rb) { pre[rb] = ra;// ra a rb b value[rb] = value[a] + c - value[b];// |_______| |_______| } else if (value[b] - value[a] != c)// |_____________| ----> 这里是c的值 ans++; } cout << ans << endl; }}
0 0
- 带权并查集 How Many Answers Are Wrong
- How Many Answers Are Wrong (带权的并查集)
- hdu 3038 How Many Answers Are Wrong(带权并查集+树的性质)
- hdu 3038 How Many Answers Are Wrong(带权并查集+树的性质)
- How Many Answers Are Wrong(带权并查集(裸))
- HDU 3038 how many answers are wrong(带权并查集)
- HDU 3038 How Many Answers Are Wrong (带权并查集+区间判断)
- HDU - 3038 How Many Answers Are Wrong (带权并查集)
- HDU 3038 How Many Answers Are Wrong(带权并查集)
- 杭电3038 How Many Answers Are Wrong(带权并查集-经典)
- 【HDU】How Many Answers Are Wrong(带权并查集)
- HDU 3038 How Many Answers Are Wrong(带权并查集)
- HDU 3038 How Many Answers Are Wrong(带权并查集)
- hdu 3038 How Many Answers Are Wrong(带权并查集)
- How Many Answers Are Wrong hdu 3038 (带权并查集)
- hdu 3038 How Many Answers Are Wrong (带权并查集入门)
- 简单并查集之带权并查集HDU3038 How Many Answers Are Wrong
- How Many Answers Are Wrong(并查集)
- [勇者闯LeetCode] 112. Path Sum
- 剑指offer-27.字符串的排列
- hover与toggle合成事件
- HDU 5245 Joyful (期望)
- 蓝桥杯 基础练习 闰年判断 Java
- How Many Answers Are Wrong (带权的并查集)
- JavaScript笔记
- apche CXF简单应用
- 蓝桥杯 基础练习 01字串 Java
- MP3文件实例剖析
- ZOJ 3950 How Many Nines
- [Leetcode] #347 Top K Frequent Elements
- Archlinux 安装qemu 及 error while loading shared libraries: libssl.so.1.1问题
- Proc笔记