ZOJ 2850 Beautiful Meadow

最新推荐文章于 2019-06-22 20:39:00 发布

原创最新推荐文章于 2019-06-22 20:39:00 发布 · 695 阅读

1 ·

本内容遵循CC 4.0 BY-SA版权协议

c/c++ 同时被 3 个专栏收录

162 篇文章

订阅专栏

15暑假培训

135 篇文章

订阅专栏

最爱水题

50 篇文章

订阅专栏

本文介绍了一个简单的算法，用于判断Tom的草地是否处于一种“美丽”的状态。根据特定条件，即草地不能全被割过也不能相邻两块都被割过，该算法通过输入的矩阵来决定草地是否符合标准。

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

相临不为0 不全为1

#include <stdio.h>

int main()
{
    int i,j,sum,n,m,a[100][100];
    while(~scanf("%d %d",&n,&m),n||m)
    {
        for(i=1;i<=n;i++)
            for(j=1;j<=m;j++)
                scanf("%d",&a[i][j]);

        int flag=1;
        sum=0;
        for(i=1;i<n;i++)
        {
            for(j=1;j<=m;j++)
            {
                if( (j<m && a[i][j]+a[i][j+1]==0) || a[i][j]+a[i+1][j]==0 )
                    {
                        flag=0;
                    }
            }
        }
        for(j=1;j<m;j++)
            if(a[i][j]+a[i][j+1]==0)
                flag=0;
        for(i=1;i<=n;i++)
            for(j=1;j<=m;j++)
                if(a[i][j]==1)
                    sum++;

        if(sum==n*m)
            flag=0;
        if(flag)
            printf("Yes\n");
        else printf("No\n");
    }
    return 0;
}