Codeforces Round #424 C. Jury Marks （思维？）

C. Jury Marks
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard 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.
题意：有一分数x，经过k个人的打分，可以变成bi（bi没有顺序），问x的方案数。
题解：对于每一个bi我们求它是怎样变过来的（通过ai的前缀和，前缀和需要去重），如果一个数出现的次数>=n说明是一个可行解。统计个数即可。
代码；

#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int>pa;
const int N=1e5+10;
const int MOD=1e9+7;
const ll INF=1e18;
int read()
{
    int x=0;
    char ch = getchar();
    while('0'>ch||ch>'9')ch=getchar();
    while('0'<=ch&&ch<='9')
    {
        x=(x<<3)+(x<<1)+ch-'0';
        ch=getchar();
    }
    return x;
}
/************************************************************/
map<int,int>mp;
map<int,int>::iterator it;
int a[N],b[N];
int aa[N];
vector<int>p;
int k,n;
int main()
{
    cin>>k>>n;
    aa[0]=0;
    for(int i=1;i<=k;i++)
    {
        cin>>a[i];
        aa[i]=aa[i-1]+a[i];
        p.push_back(aa[i]);
    }
    sort(p.begin(),p.end());
    p.erase(unique(p.begin(),p.end()),p.end());
    for(int j=1;j<=n;j++)
    {
        cin>>b[j];
    }
    int len=p.size();
    for(int i=1;i<=n;i++)
    {
        for(int j=0;j<len;j++)
        {
            mp[b[i]-p[j]]++;
        }
    }
    int ans=0;
    for(it=mp.begin();it!=mp.end();it++)
    {
        if((*it).second>=n) ans++;
    }
    cout<<ans<<endl;
}