A10403 | Bear and Finding Criminals
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
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 city $a$ . 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.
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 city $a$ . 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 $t_{1},t_{2},...,t_{n}$ ( $0<=t_{i}<=1$ ). There are $t_{i}$ criminals in the $i$ -th city.
The second line contains $n$ integers $t_{1},t_{2},...,t_{n}$ ( $0<=t_{i}<=1$ ). There are $t_{i}$ criminals in the $i$ -th city.
输出格式
Print the number of criminals Limak will catch.
输入输出样例
输入 #1
6 3 1 1 1 0 1 0
输出 #1
3
输入 #2
5 2 0 0 0 1 0
输出 #2
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.
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.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted