codeforces 831C

C. Jury Marks
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Polycarp watched TV-show where k jury members one by one rated a participant by adding him a certain number of points (may be negative, i. e. points were subtracted). Initially the participant had some score, and each the marks were one by one added to his score. It is known that the i-th jury member gave ai points.

Polycarp does not remember how many points the participant had before this k marks were given, but he remembers that among the scores announced after each of the k judges rated the participant there were n (n ≤ k) values b1, b2, …, bn (it is guaranteed that all values bj are distinct). It is possible that Polycarp remembers not all of the scores announced, i. e. n < k. Note that the initial score wasn’t announced.

Your task is to determine the number of options for the score the participant could have before the judges rated the participant.
Input

The first line contains two integers k and n (1 ≤ n ≤ k ≤ 2 000) — the number of jury members and the number of scores Polycarp remembers.

The second line contains k integers a1, a2, …, ak ( - 2 000 ≤ ai ≤ 2 000) — jury’s marks in chronological order.

The third line contains n distinct integers b1, b2, …, bn ( - 4 000 000 ≤ bj ≤ 4 000 000) — the values of points Polycarp remembers. Note that these values are not necessarily given in chronological order.
Output

Print the number of options for the score the participant could have before the judges rated the participant. If Polycarp messes something up and there is no options, print “0” (without quotes).
Examples
Input

4 1
-5 5 0 20
10

Output

3

Input

2 2
-2000 -2000
3998000 4000000

Output

1

Note

The answer for the first example is 3 because initially the participant could have  - 10, 10 or 15 points.

In the second example there is only one correct initial score equaling to 4 002 000.

题目的意思是，有k个评委，给出了k个分数。这是按时间顺序来的，然后最开始有一个分数，没一位评委打分后，自己的分数会变化，但他只记得一部分，并且不是按时间顺序来的，问你最开始的分数有多少种可能

比赛的时候就是求一下评委分数的前缀和，然后再对每一b[i]减去所有前缀和，如果某个分数在每一个b[i]减去前缀和的结果中都有的话，那么就代表这个分数是可能是开始的分数。最开始用的是map标记的方法，比赛时险过，结果后来被hack了。然后又想到可以先对前缀和排序去重，那么每一个b[i]减去后就不会有重复的，再把这个结果用book数组标记一下，如果一个数出现的次数 >= n就证明这是可能的结果

我这里是先读取的n相当于题中的k
代码如下：

#include<cstdio>
#include<cmath>
#include<cstring>
#include<string>
#include<algorithm>
#include<iostream>

using namespace std;
const int MAX = 16000010;
const int MAX_N = 2010;
const int mod = 8000000;
int book[MAX];
int a[MAX_N],b[MAX_N];
int main(void){
    int n,k;
    scanf("%d %d",&n,&k);
    a[0] = 0;
    for(int i=1;i<=n;i++){
        scanf("%d",&a[i]);
        a[i] += a[i-1];
    }
    sort(a+1,a+1+n);
    int alen = unique(a+1,a+1+n) - (a+1);
    for(int j=1;j<=k;j++){
        scanf("%d",&b[j]);
        for(int i=1;i<=alen;i++){
            book[b[j] - a[i] + mod]++;
        }
    }
    int Count = 0;
    for(int i=1;i<=MAX- 5;i++){
        if(book[i] == k)    Count++;
    }
    printf("%d",Count);
    return 0;
}