Codeforces Round #424 (Div. 2) C. Jury Marks （思维题）

本文链接：https://blog.csdn.net/HHH_go_/article/details/75263650

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.

题意：有n个打分员，分别打出n个分数，用初始分数加上每个打分员的分数就是最终分数，现在给出m个中间出现过的中间分数，问初始分数有几种。（打出的分数必须按顺序加）

分析：因为分数必须要按顺序加，所以可以先计算出前缀和。

然后问题就转换为每一个给出的中间分数分别可以有哪些初始分数，然后看哪些初始分数的个数与m相等，得出答案。（一开始是用这种想法写，然后各种tle在数据21）

wa了10次后，转换想法，因为每个中间数据之间是有关联的，所以只需要知道他们与其中一个的差值在sum中是否有出现就可以了。

AC代码：

#include<bits/stdc++.h> 
using namespace std;
map<int ,int>q,p,w;
int sum[4500],b[4500];
int vis[4500];
int main()
{
	int n,m,ans=0;
	scanf("%d%d",&n,&m);
	for(int i=0;i<n;i++)
	{
		int a;
		scanf("%d",&a);
		if(i>0)
		sum[i]=sum[i-1]+a;
		else
		sum[i]=a;
		q[sum[i]]=1;
	}
	sort(sum,sum+n);
	n=unique(sum,sum+n)-sum;
	for(int i=0;i<m;i++)
	scanf("%d",&b[i]);
	for(int i=0;i<n;i++)
	{
		int t=0;
		for(int j=0;j<m;j++)
		{
			t+=q[b[j]-b[0]+sum[i]];
		}
		if(t==m)
		ans++;
	}
	printf("%d\n",ans);
}