Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals) 831C. Jury Marks【二分】【水题】...

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

枚举出所有的情况,用二分去筛就好了


#include<iostream>
#include<algorithm>
#include<cmath>
#include<queue>
#include<cstring>
#include<stdio.h>
#include<string>
#include<map>
#include<cstring>
#include<set>
#include<vector>
#include<iomanip>
#define INF 0x3f3f3f3f
#define ms(a,b) memset(a,b,sizeof(a))
using namespace std;

const int maxn = 2010;

int n, k, a[maxn], b[maxn], num[maxn];
bool vis[maxn];

int find(int k)
{
	int l = 0, r = n, m = (l + r) >> 1;
	while (l <= r)
	{
		m = (l + r) >> 1;
		if (num[m] == k) return m;
		if (num[m] > k) r = m - 1;
		else l = m + 1;
	}
	return n;
}

int main()
{
	while (~scanf("%d%d", &n, &k))
	{
		for (int i = 0; i < n; i++)
		{
			scanf("%d", a + i);
			if (i == 0) num[0] = a[0];
			else
			{
				num[i] = num[i - 1] + a[i];
			}
		}
		sort(num, num + n);
		for (int i = 0; i < k; i++) scanf("%d", b + i);
		sort(b, b + k);
		set<int> se;
		for (int i = 0; i < n; i++)
		{
			for (int j = 0; j < k; j++)
			{
				se.insert(b[j] - num[i]);
			}
		}
		set<int>::iterator it;
		int ans = 0;
		for (it = se.begin(); it != se.end(); it++)
		{
			bool ok = 1;
			for (int i = 0; i < k; i++)
			{
				if (find(b[i] - *it) == n)
				{
					ok = 0;
					break;
				}
			}
			if (ok) ans++;
		}
		printf("%d\n", ans);
	}
}



转载于:https://www.cnblogs.com/Archger/p/8451620.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值