hdu 3038 How Many Answers Are Wrong

218人阅读 评论(0) 收藏 举报

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


并查集来确定集合关系,然后用一个sum[] (表示到根节点的和)来判断是否正确。

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <math.h>
#define maxn 220000
using namespace std;
int sum[maxn];//指到根节点的和
int pre[maxn];
int findroot(int x)
        int f=pre[x];
    return pre[x];
int main()
    int n,m;
        for(int i = 0; i <= n; i++)
            pre[i] = i;
        int ans = 0;
        for(int i = 0; i < m; i++)
            int a,b,w;
            int roota = findroot(a);
            int rootb = findroot(b);
            if(roota != rootb)
                pre[roota] = rootb;
                sum[roota] = sum[b] - sum[a] + w;
                if(sum[a] - sum[b] != w)
    return 0;

hdu3038How Many Answers Are Wrong(并查集)

题意:给出一些区间[l,r]的和为S,问有多少个是矛盾的 思路:对给出的区间[l,r]将左边减一变成(l-1,r]合并,把数值小的当做根节点更新即可,有一点不懂的是只会用递归来更新,用while循环...
  • qq_21057881
  • qq_21057881
  • 2016年01月31日 09:50
  • 432

How Many Answers Are Wrong(并查集)

How Many Answers Are Wrong Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (...
  • qq_32823673
  • qq_32823673
  • 2017年04月11日 14:19
  • 157

HDU 3038 How Many Answers Are Wrong(并查集)

题目链接:[kuangbin带你飞]专题五 并查集 D - How Many Answers Are Wrong题意 有n次询问,给出a到b区间的总和,问这n次给出的总和中有几次是和前面已近给出的...
  • to_be_better
  • to_be_better
  • 2016年03月29日 20:59
  • 1213

How Many Answers Are Wrong 并查集

题意为前两个数之间的和为第三个数,这个题我们可以这么考虑,比如a 到 b之间和为 s,那么 s = (开始到b之间的和) - (开始到a-1之间的和),ab的根相等 那么它们在一个集合里 那么s即为它...
  • tydfhihfhgjkj
  • tydfhihfhgjkj
  • 2015年09月14日 22:43
  • 143

hdu 3038 - How Many Answers Are Wrong(并查集)

题意:     已知多个描述,每个描述都给出一个区间的它的和,求这些描述中错误描述的个数。 思路:     思路和poj1733差不多,就是把利用并查集把所有区间的起点和终点都放到集合里面,其中...
  • shankeliupo
  • shankeliupo
  • 2013年10月23日 12:55
  • 328

HDU 3038 How Many Answers Are Wrong

带权并查集 #include #include #include #include #include #include #include #include #include #in...
  • u011728372
  • u011728372
  • 2013年12月20日 15:07
  • 394

hdu 3038 How Many Answers Are Wrong(并查集)

题目链接:hdu 3038 How Many Answers Are Wrong 题目大意:略。 解题思路:并查集水题。 #include #include #include u...
  • u011328934
  • u011328934
  • 2014年08月08日 22:45
  • 557

hdu 3038 How Many Answers Are Wrong【带权并查集】

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=3038 题意:给出两个数N和M代表有N个数个M组数据 N个数是未知的,然后M组数据每组数据形如:l ...
  • letterwuyu
  • letterwuyu
  • 2015年05月06日 21:30
  • 550

How Many Answers Are Wrong hdu 3038 (带权并查集)

Problem Description TT and FF are ... friends. Uh... very very good friends -________-b FF is a ...
  • xiaosshhaa
  • xiaosshhaa
  • 2017年03月19日 16:53
  • 156

hdu 3038 How Many Answers Are Wrong

  • u011561033
  • u011561033
  • 2013年09月07日 13:22
  • 538
    访问量: 3017
    积分: 387
    排名: 19万+