A11113 | Rectangles
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You are given $n×m$ table. Each cell of the table is colored white or black. Find the number of non-empty sets of cells such that:
1. All cells in a set have the same color.
2. Every two cells in a set share row or column.
1. All cells in a set have the same color.
2. Every two cells in a set share row or column.
输入格式
The first line of input contains integers $n$ and $m$ ( $1<=n,m<=50$ ) — the number of rows and the number of columns correspondingly.
The next $n$ lines of input contain descriptions of rows. There are $m$ integers, separated by spaces, in each line. The number equals $0$ if the corresponding cell is colored white and equals $1$ if the corresponding cell is colored black.
The next $n$ lines of input contain descriptions of rows. There are $m$ integers, separated by spaces, in each line. The number equals $0$ if the corresponding cell is colored white and equals $1$ if the corresponding cell is colored black.
输出格式
Output single integer — the number of non-empty sets from the problem description.
输入输出样例
输入 #1
1 1 0
输出 #1
1
输入 #2
2 3 1 0 1 0 1 0
输出 #2
8
In the second example, there are six one-element sets. Additionally, there are two two-element sets, the first one consists of the first and the third cells of the first row, the second one consists of the first and the third cells of the second row. To sum up, there are $8$ sets.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted