当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

4949:Light

题目描述
Teacher Mai has a board of n rows and m columns. There is a light in each cell.

He can flip some lights: if this light is on, turn it off, else turn it on.

He can choose a cell(i,j), and he has following two operations:

1. Flip the light on the cells which share a common edge with cell(i,j).
2. Flip the light on the cells which share a common edge with cell(i,j) and cell(i,j).
  
You are given the initial state of board. Output the minimum operations to turn off the all the lights.
输入解释
There are multiple test cases, terminated by a line "0 0".

For each test case, the first line contains two integers n,m(1<=n,m<=10).

In following n lines, each line contains a string consisting of m characters, representing the initial state(0 means off, 1 means on).
输出解释
For each case, output "Case #k: ans" first, where k is the case number counting from 1, ans is the minimum operations.
输入样例
3 3
111
111
111
3 3
000
010
000
0 0
输出样例
Case #1: 3
Case #2: 2
来自杭电HDUOJ的附加信息
Author xudyh
Recommend

该题目是Virtual Judge题目,来自 杭电HDUOJ

源链接: HDU-4949

最后修改于 2020-10-25T23:18:21+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
18000/9000MS(Java/Others) 65536/65536K(Java/Others)