首页 > ACM题库 > HDU-杭电 > HDU 3038-How Many Answers Are Wrong-并查集-[解题报告]HOJ
2014
02-27

HDU 3038-How Many Answers Are Wrong-并查集-[解题报告]HOJ

How Many Answers Are Wrong

问题描述 :

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

Saving Beans

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.

输出:

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.

样例输入:

10 5
1 10 100
7 10 28
1 3 32
4 6 41
6 6 1

样例输出:

1

题目:给出一些询问,[l,r]的和为s,问有多少个是错的

//并查集 ,,sum[a]表示a与父亲这条路径上的和
 #include <iostream>
 #include <cstdio>
 #include <cstring>
 #include <algorithm>
 
 using namespace std;
 
 const int maxn = 2e5 + 5;
 int fa[maxn], sum[maxn];
 int n, m, l, r, s;
 int findFa(int x){
     if (x != fa[x]){
         int t = fa[x];
         fa[x] = findFa(fa[x]);
         sum[x] += sum[t];
     }
     return fa[x];
 }
 int main(){
     while (~scanf("%d%d", &n, &m)){
         for (int i = 0; i <= n; ++i){
             fa[i] = i;
             sum[i] = 0;
         }
         int ans = 0;
         while (m--){
             scanf("%d%d%d", &l, &r, &s);
             l --;
             int pa = findFa(l), pb = findFa(r);
             if (pa == pb){
                 if (sum[r] - sum[l] != s) ans++;
             }
             else {
                 fa[pb] = pa;
                 sum[pb] = sum[l] - sum[r] + s;
             }
         }
         printf("%d\n", ans);
     }
     return 0;
 }

 

参考:http://www.cnblogs.com/Missa/p/3416617.html


  1. 博主您好,这是一个内容十分优秀的博客,而且界面也非常漂亮。但是为什么博客的响应速度这么慢,虽然博客的主机在国外,但是我开启VPN还是经常响应很久,再者打开某些页面经常会出现数据库连接出错的提示

  2. 很高兴你会喜欢这个网站。目前还没有一个开发团队,网站是我一个人在维护,都是用的开源系统,也没有太多需要开发的部分,主要是内容整理。非常感谢你的关注。