hdu 3038 How Many Answers Are Wrong 带权并查集
来源:互联网 发布:做网络销售公司好做吗 编辑:程序博客网 时间:2024/04/30 05:13
点击打开链接题目链接
How Many Answers Are Wrong
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2518 Accepted Submission(s): 985
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)
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
第a个 到 第b个的总和为c
要求输出总共有几个错误的信息
代码:
#include<stdio.h>int father[200200];int ans[200200];int find(int a){ if(a==father[a]) return a; int t=father[a]; father[a]=find(father[a]); ans[a]+=ans[t]; return father[a];}int add(int a,int b,int c){ int x=find(a); int y=find(b); if(x==y) { if(ans[a]+c!=ans[b]) return 0; } father[y]=x; ans[y]=ans[a]-ans[b]+c; return 1;}int main(){ int n,m,i; int a,b,c; int cnt; while(scanf("%d %d",&n,&m)!=EOF) { for(i=1;i<=n;i++) { ans[i]=0; father[i]=i; } cnt=0; while(m--) { scanf("%d %d %d",&a,&b,&c); if(add(a-1,b,c)==0) cnt++; } printf("%d\n",cnt); }}
0 0
- 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带权并查集
- 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 带权并查集
- 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(带权并查集+树的性质)
- HDU 3038How 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 (带权并查集)
- hdu-3038-How Many Answers Are Wrong-带权并查集
- How to run cpp-tests on Mac OSX
- hdu 2089 不要62 (数位dp)
- SYSTEM权限引发的系列问题
- c#使用DotNetZip封装类操作zip文件(创建/读取/更新)实例
- 焉的样子,王浩波看出来来,站起逼
- hdu 3038 How Many Answers Are Wrong 带权并查集
- Python中的正则表达式
- linux新建用户后shell无法自动补全命令,Backspace无法删除字符,无法翻看输入纪录
- 由卖票程序来理解线程
- Tomcat 拒绝服务总结
- POJ 3468-A Simple Problem with Integers(线段树_区间更新+lazy标记)
- How to use CCache to speed up cocos2d-x android compilation
- 计算机是如何启动的?
- Shuttle ESB介绍