How Many Answers Are Wrong
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9169 Accepted Submission(s): 3335
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).
![](https://i-blog.csdnimg.cn/blog_migrate/956a59c85e195b555e72de064fd5a563.jpeg)
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 5 1 10 100 7 10 28 1 3 32 4 6 41 6 6 1
Sample Output
1
Source
Recommend
带权并查集 首先每一个区间r++ 表示 [l,r)左闭右开区间的sum
val数组表示当前i到i的最近的一个父节点之间的路径长度(即小区间sum)
输入 l r 把r++ 然后查询 l r是不是在一个根节点下,在的话说明我们可以求出来
l 到 r 的距离,看时候矛盾;否则不能,进行更新操作。
另外,这道题其实是有多组case的
val数组表示当前i到i的最近的一个父节点之间的路径长度(即小区间sum)
输入 l r 把r++ 然后查询 l r是不是在一个根节点下,在的话说明我们可以求出来
l 到 r 的距离,看时候矛盾;否则不能,进行更新操作。
另外,这道题其实是有多组case的
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<vector>
#include<map>
#include<string>
#include<cmath>
#define maxlen 200000+7
using namespace std;
/*
带权并查集 首先每一个区间r++ 表示 [l,r)左闭右开区间的sum
val数组表示当前i到i的最近的一个父节点之间的路径长度(即小区间sum)
输入 l r 把r++ 然后查询 l r是不是在一个根节点下,在的话说明我们可以求出来
l 到 r 的距离,看时候矛盾;否则不能,进行更新操作。
另外,这道题其实是有多组case的
*/
int n, m;
int l, r;
int summ;
int ans;
int par[maxlen];
int val[maxlen];
int ffind(int x, int &valnow)
{
int root = x;
//cout<<root<<endl;
while(root != par[root])
{
valnow += val[root];//valnow维护最大区间的sum 即x到最远的的father节点
root = par[root];
}
//cout<<root<<endl;
return root;
}
int main()
{
//freopen("test.txt","r",stdin);
//init
while(scanf("%d %d", &n, &m) != EOF)
{
ans = 0;
for(int i = 1; i <= n+3; i++)
{
par[i] = i;
val[i] = 0;
}
//input and do
//scanf("%d %d", &n, &m);
for(int i = 0; i < m; i++)
{
scanf("%d %d %d", &l, &r, &summ);
r++;
int vall = 0;
int fl = ffind(l, vall);
int valr = 0;
int fr = ffind(r, valr);
//cout<<fl<<" "<<fr<<endl;
if(fl != fr)
{
//合并操作
if(fl < fr)
{
//将右边的合并到左边
val[fr] = summ + vall - valr ;
par[fr] = fl;
}
else
{
//左边合并到右边
val[fl] = valr - summ - vall;
par[fl] = fr;
}
}
else
{
//查询的操作
int res=valr-vall;
if(res != summ)
ans++;
}
}
/*
for(int i=1;i<=n+1;i++)
cout<<val[i]<<" ";
cout<<endl;
*/
printf("%d\n", ans);
}
return 0;
}