Technocup 2017 - Elimination Round 2
B
Spotlights
Codeforces
1200
原题
← AC →
翻译中…

Theater stage is a rectangular field of size $*n* × *m*$. The director gave you the stage's plan which actors will follow. For each cell it is stated in the plan if there would be an actor in this cell or not.

翻译中…

You are to place a spotlight on the stage in some good position. The spotlight will project light in one of the four directions (if you look at the stage from above) — left, right, up or down. Thus, the spotlight's position is a cell it is placed to and a direction it shines.

翻译中…

A position is good if two conditions hold:

翻译中…
  • there is no actor in the cell the spotlight is placed to;
  • there is at least one actor in the direction the spotlight projects.
翻译中…

Count the number of good positions for placing the spotlight. Two positions of spotlight are considered to be different if the location cells or projection direction differ.

翻译中…

Input

翻译中…

The first line contains two positive integers $*n*$ and $*m*$ ($1 ≤ *n*, *m* ≤ 1000$) — the number of rows and the number of columns in the plan.

翻译中…

The next $*n*$ lines contain $*m*$ integers, $0$ or $1$ each — the description of the plan. Integer $1$, means there will be an actor in the corresponding cell, while $0$ means the cell will remain empty. It is guaranteed that there is at least one actor in the plan.

翻译中…

Output

翻译中…

Print one integer — the number of good positions for placing the spotlight.

翻译中…

Note

翻译中…

In the first example the following positions are good:

翻译中…
  1. the (1, 1) cell and right direction;
  2. the (1, 1) cell and down direction;
  3. the (1, 3) cell and left direction;
  4. the (1, 3) cell and down direction;
  5. the (1, 4) cell and left direction;
  6. the (2, 2) cell and left direction;
  7. the (2, 2) cell and up direction;
  8. the (2, 2) and right direction;
  9. the (2, 4) cell and left direction.
翻译中…

Therefore, there are $9$ good positions in this example.

翻译中…

样例

Input #1
2 4
0 1 0 0
1 0 1 0
Output #1
9
InputCopy OutputCopy
Input #2
4 4
0 0 0 0
1 0 0 1
0 1 1 0
0 1 0 0
Output #2
20
InputCopy OutputCopy
题目信息
题号
729B
时间限制
1 s
内存限制
256 MB
标签
动态规划
模拟

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。