【Codeforces】831C Jury Marks
来源:互联网 发布:矩阵和向量相乘公式 编辑:程序博客网 时间:2024/06/05 14:51
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.
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.
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).
4 1-5 5 0 2010
3
2 2-2000 -20003998000 4000000
1
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,每次对这个基础分加上ki(按顺序),已知在加的过程中出现的中间分(无顺序),问基础分有几种可能
思路:开始想假设每一个已知分的顺序,减去k,仍如map里,但是t了。用前缀和,排序,枚举最小已知分的顺序,若满足条件,放入set里
#include <cstdio>#include <cstring>#include <algorithm>#include <map>#include <set>#define maxn 2003using namespace std;int main(){int k, n;int a[maxn] = { 0 }, b[maxn] = { 0 };while (~scanf("%d%d", &k, &n)) {set<int>s;for (int i = 1; i <= k; i++) { scanf("%d", &a[i]);a[i] += a[i - 1];}for (int i = 1; i <= n; i++)scanf("%d", &b[i]);sort(a + 1, a + 1 + k);sort(b + 1, b + 1 + n);for (int i = 1; i <= k; i++) {int x = b[1] - a[i];int cot = 2;for (int j = i + 1; j <= k; j++) {if (x + a[j] == b[cot]) cot++;}if (cot == n + 1) s.insert(x);}printf("%d\n", s.size());}return 0;}
- CodeForces 831C Jury Marks
- Codeforces 831 C Jury Marks
- codeforces 831C Jury Marks
- 【Codeforces】831C Jury Marks
- Codeforces-831C Jury Marks
- CodeForces 831C Jury Marks(set)
- Codeforces-831C Jury Marks(暴力)
- Codeforces 831C Jury Marks【暴力枚举】
- CodeForces 831C Jury Marks(stl)
- 【Codeforces 831 C. Jury Marks】+ STL
- CodeForces 831C : Jury Marks(set的使用)
- Codeforces Round #424 C Jury Marks 思维
- CF --- 831C Jury Marks 【思维】
- Codeforces831 C. Jury Marks
- C. Jury Marks
- C.Jury Marks
- Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals)-831C Jury Marks(思维)
- Codeforces Round #424 C. Jury Marks (思维?)
- 文章标题 HDU 3507 :Print Article (斜率dp优化)
- elasticsearch之Document APIs【Delete API】
- [学习笔记] 后缀自动机学习笔记
- XtraBackup工作原理
- java基础之多态
- 【Codeforces】831C Jury Marks
- makefile增量编译的笔记
- vue2.0 父子组件之间的通信问题
- POJ 2135 Farm Tour (最小费用最大流模板题)
- 数据库学习
- Prime Ring Problem
- mysql根据查询条件更新
- Xtrabackup备份 还原
- 使用浏览器访问azkaban报错:javax.net.ssl.SSLException: Unrecognized SSL message, plaintext connection?