Solution of ZOJ 2850 Beautiful Meadow
来源:互联网 发布:皮肤不好 知乎 编辑:程序博客网 时间:2024/05/16 06:09
Tom's Meadow
Tom has a meadow in his garden. He divides it into N * M squares. Initially all the squares were covered with grass. He mowed down the grass on some of the squares and thinks the meadow is beautiful if and only if
- Not all squares are covered with grass.
- No two mowed squares are adjacent.
Two squares are adjacent if they share an edge. Here comes the problem: Is Tom's meadow beautiful now?
Input
The input contains multiple test cases!
Each test case starts with a line containing two integers N, M (1 <= N, M <= 10) separated by a space. There follows the description of Tom's Meadow. There're N lines each consisting of M integers separated by a space. 0(zero) means the corresponding position of the meadow is mowed and 1(one) means the square is covered by grass.
A line with N = 0 and M = 0 signals the end of the input, which should not be processed
Output
One line for each test case.
Output "Yes" (without quotations) if the meadow is beautiful, otherwise "No"(without quotations).
Sample Input
2 2
1 0
0 1
2 2
1 1
0 0
2 3
1 1 1
1 1 1
0 0
Sample Output
Yes
No
No
Source: Zhejiang Provincial Programming Contest 2007
分析:本题关键点在于统计0的个数以及搜索是否存在纵向和横向两个方向之一存在连续0的情况。
下面给出我的实现代码:
- Solution of ZOJ 2850 Beautiful Meadow
- zoj 2850 Beautiful Meadow
- ZOJ 2850 Beautiful Meadow
- ZOJ 2850 Beautiful Meadow
- ZOJ 2850 Beautiful Meadow
- zoj 2850 Beautiful Meadow
- ZOJ 2850 Beautiful Meadow
- ZOJ 2850Beautiful Meadow
- ZOJ 2850 Beautiful Meadow
- zoj 2850 Beautiful Meadow 水题
- zoj 2850 Beautiful Meadow(水~)
- [水] zoj 2850 Beautiful Meadow
- ZOJ Problem Set - 2850 Beautiful Meadow
- ZOJ Problem Set - 2850 Beautiful Meadow
- zoj 3213 Beautiful Meadow
- ZOJ 1850 Beautiful Meadow
- ZOJ 3213 Beautiful Meadow
- ZOJ-2850-Beautiful Meadow【暴力】【4th浙江省赛】
- Aptina荣获2010年EDN创新奖
- 避免遮掩继承而来的名称——effective c++学习笔记
- 区分接口继承和实现继承——effective c++学习笔记
- 考虑virtual函数之外的其他选择——effective c++学习笔记
- 为CListCtrl每一行设置不同的颜色
- Solution of ZOJ 2850 Beautiful Meadow
- 我想问两个 关于 File类得 两个方法的问题
- 第13章 int指令 笔记
- KNN ( K最近邻法) 原理。
- VC2005调试时出现“No Debugging Information”错误
- 记录下CTime::Format的参数
- 5.11
- [转]在C++中,内存分成5个区——堆、栈、自由存储区、全局/静态存储区和常量存储区
- 新人加入,多多指教