A10149 | Vitaly and Night
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
One day Vitaly was going home late at night and wondering: how many people aren't sleeping at that moment? To estimate, Vitaly decided to look which windows are lit in the house he was passing by at that moment.
Vitaly sees a building of $n$ floors and $2·m$ windows on each floor. On each floor there are $m$ flats numbered from $1$ to $m$ , and two consecutive windows correspond to each flat. If we number the windows from $1$ to $2·m$ from left to right, then the $j$ -th flat of the $i$ -th floor has windows $2·j-1$ and $2·j$ in the corresponding row of windows (as usual, floors are enumerated from the bottom). Vitaly thinks that people in the flat aren't sleeping at that moment if at least one of the windows corresponding to this flat has lights on.
Given the information about the windows of the given house, your task is to calculate the number of flats where, according to Vitaly, people aren't sleeping.
Vitaly sees a building of $n$ floors and $2·m$ windows on each floor. On each floor there are $m$ flats numbered from $1$ to $m$ , and two consecutive windows correspond to each flat. If we number the windows from $1$ to $2·m$ from left to right, then the $j$ -th flat of the $i$ -th floor has windows $2·j-1$ and $2·j$ in the corresponding row of windows (as usual, floors are enumerated from the bottom). Vitaly thinks that people in the flat aren't sleeping at that moment if at least one of the windows corresponding to this flat has lights on.
Given the information about the windows of the given house, your task is to calculate the number of flats where, according to Vitaly, people aren't sleeping.
输入格式
The first line of the input contains two integers $n$ and $m$ ( $1<=n,m<=100$ ) — the number of floors in the house and the number of flats on each floor respectively.
Next $n$ lines describe the floors from top to bottom and contain $2·m$ characters each. If the $i$ -th window of the given floor has lights on, then the $i$ -th character of this line is '1', otherwise it is '0'.
Next $n$ lines describe the floors from top to bottom and contain $2·m$ characters each. If the $i$ -th window of the given floor has lights on, then the $i$ -th character of this line is '1', otherwise it is '0'.
输出格式
Print a single integer — the number of flats that have lights on in at least one window, that is, the flats where, according to Vitaly, people aren't sleeping.
输入输出样例
输入 #1
2 2 0 0 0 1 1 0 1 1
输出 #1
3
输入 #2
1 3 1 1 0 1 0 0
输出 #2
2
In the first test case the house has two floors, two flats on each floor. That is, in total there are 4 flats. The light isn't on only on the second floor in the left flat. That is, in both rooms of the flat the light is off.
In the second test case the house has one floor and the first floor has three flats. The light is on in the leftmost flat (in both windows) and in the middle flat (in one window). In the right flat the light is off.
In the second test case the house has one floor and the first floor has three flats. The light is on in the leftmost flat (in both windows) and in the middle flat (in one window). In the right flat the light is off.
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted