CodeForces - 831C Jury Marks (set思维)
2017-07-20 19:17
363 查看
题目链接:http://codeforces.com/problemset/problem/831/C点击打开链接
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
output
input
output
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.
set乱搞。。首先要注意的是他的bi表示的是无序的 那么我们可以记录下这些数据 枚举每个可能是初试分数的值 然后依次判断是否符合每个结果都能存在 一旦发现不存在就跳过
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.
set乱搞。。首先要注意的是他的bi表示的是无序的 那么我们可以记录下这些数据 枚举每个可能是初试分数的值 然后依次判断是否符合每个结果都能存在 一旦发现不存在就跳过
#include <bits/stdc++.h> using namespace std; int a[2222]; int b[2222]; int main() { set<int > s; set<int>::iterator its; s.clear(); int n;int k; scanf("%d%d",&k,&n); for(int i=0;i<k;i++) scanf("%d",&a[i]); for(int i=0;i<n;i++) scanf("%d",&b[i]); int sum1=0; for(int i=0;i<k;i++) { sum1+=a[i]; s.insert(sum1); } int ans=s.size(); for (its=s.begin();its!=s.end();its++) { int bigin=b[0]-*its; for(int j=0;j<n;j++) { if(!s.count(b[j]-bigin)) { ans--; break; } } } cout << ans; }
相关文章推荐
- CodeForces 831C : Jury Marks(set的使用)
- CF --- 831C Jury Marks 【思维】
- (CodeForces - 831C)Jury Marks
- CodeForces - 831C: Jury Marks(前缀和去重、STL)
- 【CodeForces - 831C Jury Marks】 暴力
- Codeforces 831C Jury Marks【暴力枚举】
- cf 831C - Jury Marks 【二分】
- CodeForces - 831C Jury Marks binary_search
- C. Jury Marks 思维题
- Jury Marks <思维题>
- CodeForces 274A k-Multiple Free Set【思维】
- Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals) 831C. Jury Marks【二分】【水题】
- Codeforces 831 C Jury Marks
- Codeforces 303A Lucky Permutation Triple 【构造 思维】
- Codeforces 757 C Felicity is Coming! 【STL+思维】
- CodeForces 626B Cards(数学思维)
- Codeforces 371E Subway Innovation【思维+前缀和】
- Codeforces 534 C. Polycarpus' Dice【思维】
- codeforces-754【A思维】
- Balanced Substring CodeForces - 873B(思维+前缀和)