3046：Pleasant sheep and big big wolf

题目描述

In ZJNU, there is a well-known prairie. And it attracts pleasant sheep and his companions to have a holiday. Big big wolf and his families know about this, and quietly hid in the big lawn. As ZJNU ACM/ICPC team, we have an obligation to protect pleasant sheep and his companions to free from being disturbed by big big wolf. We decided to build a number of unit fence whose length is 1. Any wolf and sheep can not cross the fence. Of course, one grid can only contain an animal.
Now, we ask to place the minimum fences to let pleasant sheep and his Companions to free from being disturbed by big big wolf and his companions.

输入解释

There are many cases.
For every case:

N and M（N,M<=200）
then N*M matrix:
0 is empty, and 1 is pleasant sheep and his companions, 2 is big big wolf and his companions.

输出解释

For every case:

First line output “Case p:”, p is the p-th case;
The second line is the answer.

输入样例

4 6
1 0 0 1 0 0
0 1 1 0 0 0
2 0 0 0 0 0
0 2 0 1 1 0

输出样例

Case 1:
4

来自杭电HDUOJ的附加信息

Recommend

gaojie

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

题目来源 2009 Multi-University Training Contest 14 - Host by ZJNU

源链接： HDU-3046

最后修改于 2020-10-25T22:59:33+00:00 由爬虫自动更新

共提交 0 次

通过率 --%

时间上限	内存上限
2000/1000MS(Java/Others)	32768/32768K(Java/Others)