HDU3038: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): 16338 Accepted Submission(s): 5724
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=3038
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
Sample Output:
1
题解:
这题干......直接看我写的另一份题解吧:https://www.cnblogs.com/heyuhhh/p/9977617.html
代码也差不多的,注意这是多组数据!!如下:
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <cmath>
using namespace std; typedef long long ll;
const int N = ;
ll f[N],sum[N];
int t,n,m; int find(int x){
if(f[x]==x) return x;
int tmp = f[x];
f[x]=find(f[x]);
sum[x]+=sum[tmp];
return f[x];
} int main(){
while(~scanf("%d%d",&n,&m)){
memset(sum,,sizeof(sum));
for(int i=;i<=n+;i++) f[i]=i;
int ans = ;
for(int i=,x,y,w;i<=m;i++){
scanf("%d%d%d",&x,&y,&w);y++;
int fx = find(x),fy=find(y);
if(fx==fy){
if(sum[y]-sum[x]!=w) ans++;
}else{
f[fy]=fx;
sum[fy]=sum[x]-sum[y]+w;
}
}
printf("%d\n",ans);
}
return ;
}
最新文章
- C++ 与 php 的交互 之----- C++ 异步获取 网页文字内容,异步获取 php 的 echo 值。
- C++运算符重载
- hbase-site.xml中HBASE_CLASSPATH 的设置
- .net sharepoint文档库操作
- P2680 运输计划
- testng标签运行顺序
- MongoDB管理与开发精要 书摘
- 进一步解 apt-get 的几个命令
- X86在逻辑地址、线性地址、理解虚拟地址和物理地址
- 【学习】苹果iPhone safari浏览器样式重置修复按钮圆角bug
- [HNOI2008] GT考试
- 【BZOJ3924】幻想乡战略游戏(动态点分治)
- js时间戳转化时间格式
- TNS-12535: TNS:operation timed out
- 关于main函数的参数问题
- bzoj 5185 Lifeguards - 动态规划 - 贪心
- 开启C语言的学习之门
- [knowledge][lisp] lisp与AI
- stl源码剖析 详细学习笔记 算法(2)
- Javascript原型继承原理