★【16.6.2】Codeforces Round #356 (Div. 2) B. Bear and Finding Criminals
来源:互联网 发布:浪潮软件论坛 编辑:程序博客网 时间:2024/06/09 16:33
There are n cities in Bearland, numbered 1 through n. Cities are arranged in one long row. The distance between cities i and j is equal to|i - j|.
Limak is a police officer. He lives in a city a. His job is to catch criminals. It's hard because he doesn't know in which cities criminals are. Though, he knows that there is at most one criminal in each city.
Limak is going to use a BCD (Bear Criminal Detector). The BCD will tell Limak how many criminals there are for every distance from a citya. After that, Limak can catch a criminal in each city for which he is sure that there must be a criminal.
You know in which cities criminals are. Count the number of criminals Limak will catch, after he uses the BCD.
The first line of the input contains two integers n and a (1 ≤ a ≤ n ≤ 100) — the number of cities and the index of city where Limak lives.
The second line contains n integers t1, t2, ..., tn (0 ≤ ti ≤ 1). There are ti criminals in the i-th city.
Print the number of criminals Limak will catch.
6 31 1 1 0 1 0
3
5 20 0 0 1 0
1
In the first sample, there are six cities and Limak lives in the third one (blue arrow below). Criminals are in cities marked red.
Using the BCD gives Limak the following information:
- There is one criminal at distance 0 from the third city — Limak is sure that this criminal is exactly in the third city.
- There is one criminal at distance 1 from the third city — Limak doesn't know if a criminal is in the second or fourth city.
- There are two criminals at distance 2 from the third city — Limak is sure that there is one criminal in the first city and one in the fifth city.
- There are zero criminals for every greater distance.
So, Limak will catch criminals in cities 1, 3 and 5, that is 3 criminals in total.
In the second sample (drawing below), the BCD gives Limak the information that there is one criminal at distance 2 from Limak's city. There is only one city at distance 2 so Limak is sure where a criminal is
题意:每次判断离出发点范围距离多少的点,不能确定总数不加。确定的方案:两边都是1,一边是1,另一边超出范围、
代码:
#include <iostream>#include <cstdio>#include <cmath>#include <map>#include <algorithm>#include <cstring>using namespace std;int i,j;int n,m,d,sum;int a[9999];int main(){ while(~scanf("%d%d",&n,&m)) { //printf("%d\n",sum); sum=0; memset(a,0,sizeof(a)); for(i=1;i<=n;i++) { scanf("%d",&a[i]); } for(i=1;i<=n;i++) { d=m-i; if(m+d>n&&a[i]==1) { sum++; } else if(a[i]==1&&m+d<=0) { sum++; } else if(a[i]==1&&a[m+d]==1) { sum++; } } printf("%d\n",sum); } return 0;}
- Codeforces Round #356 (Div. 2) B Bear and Finding Criminals
- ★【16.6.2】Codeforces Round #356 (Div. 2) B. Bear and Finding Criminals
- Codeforces-Round-#356-(Div.-2)-Bear-and-Finding-Criminals
- Codeforces Round #356 (Div. 2)-B. Bear and Finding Criminals(模拟)
- B. Bear and Finding Criminals
- CodeForces 680B Bear and Finding Criminals(捉小偷)
- CodeForces 680B Bear and Finding Criminals 简单模拟
- Codeforces 680B Bear and Finding Criminals【模拟】
- Codeforces Round #226 (Div. 2) B. Bear and Strings
- Codeforces Round #226 (Div. 2)B. Bear and Strings
- Codeforces Round #226 (Div. 2)B. Bear and Strings
- ★【16.6.2】Codeforces Round #356 (Div. 2) C. Bear and Prime 100
- ★【16.6.9】Codeforces Round #356 (Div. 2) A. Bear and Five Cards
- Codeforces Round #356 (Div. 2) A - Bear and Five Cards
- Codeforces Round #356 (Div. 2)-C. Bear and Prime 100
- Codeforces-Round-#356-(Div.-2)-Bear-and-Five-Cards
- Codeforces Round #356 (Div. 2) Bear and Square Grid
- Codeforces Round #356 (Div. 2)-C. Bear and Prime 100
- 2016 UESTC Training for Math Problem C-咸鱼的跑步比赛(解同余线性方程组)
- 2016 UESTC Training for Math Problem D-熄灯啦!(乱搞)
- 2016 UESTC Training for Math Problem F-粗心的谭爷(线性筛素数)
- 设计模式-抽象工厂和builder模式
- ★【16.6.9】Codeforces Round #356 (Div. 2) A. Bear and Five Cards
- ★【16.6.2】Codeforces Round #356 (Div. 2) B. Bear and Finding Criminals
- ★【16.6.2】Codeforces Round #356 (Div. 2) C. Bear and Prime 100
- retrofit 2.0 简单使用
- Add Digits
- leecode_240 Search a 2D Matrix II
- Servlet & JSP 面试题
- Maximum Depth of Binary Tree
- Linux课上学习c语言文件操作及读写
- Compare Version Numbers