Zero_979

ACM萌新的做题记录

#483(div.2) B. Minesweeper

题目地址:http://codeforces.com/contest/984/problem/B

题目:

One day Alex decided to remember childhood when computers were not too powerful and lots of people played only default games. Alex enjoyed playing Minesweeper that time. He imagined that he saved world from bombs planted by terrorists, but he rarely won.

Alex has grown up since then, so he easily wins the most difficult levels. This quickly bored him, and he thought: what if the computer gave him invalid fields in the childhood and Alex could not win because of it?

He needs your help to check it.

A Minesweeper field is a rectangle n×mn×m, where each cell is either empty, or contains a digit from 11 to 88, or a bomb. The field is valid if for each cell:

  • if there is a digit kk in the cell, then exactly kk neighboring cells have bombs.
  • if the cell is empty, then all neighboring cells have no bombs.

Two cells are neighbors if they have a common side or a corner (i. e. a cell has at most 88 neighboring cells).

Input

The first line contains two integers nn and mm (1n,m1001≤n,m≤100) — the sizes of the field.

The next nn lines contain the description of the field. Each line contains mm characters, each of them is "." (if this cell is empty), "*" (if there is bomb in this cell), or a digit from 11 to 88, inclusive.

Output

Print "YES", if the field is valid and "NO" otherwise.

You can choose the case (lower or upper) for each letter arbitrarily.

Examples
input
Copy
3 3
111
1*1
111
output
Copy
YES
input
Copy
2 4
*.*.
1211
output
Copy
NO
Note

In the second example the answer is "NO" because, if the positions of the bombs are preserved, the first line of the field should be *2*1.

You can read more about Minesweeper in Wikipedia's article.

思路:

这道题就是验证扫雷内部的东西对不对,假如有一个*(炸弹),那么它的八连通块都得加一,如果一个格子是0则显示“.”。于是只要找到*然后用另一个数组把它周围都加一,最后两个数组比较一下就好啦。

代码:

#include<iostream>
#include<cstring>
using namespace std;
int n,m;
char maze[101][101];
int d[101][101];
int dx[8]={-1,-1,-1,0,0,1,1,1},dy[8]={-1,0,1,1,-1,-1,0,1};
void add(int x,int y)
{
    int i;
    for(i=0;i<8;i++)
    {
        int nx=x+dx[i],ny=y+dy[i];
        if(nx>=0&&nx<n&&ny>=0&&ny<m&&maze[nx][ny]!='*')d[nx][ny]=d[nx][ny]+1;
    }
}
int main()
{
    while(cin>>n>>m)
    {
        memset(d,0,sizeof(d));
        int i,j;
        for(i=0;i<n;i++)
        {
            for(j=0;j<m;j++)
            {
                cin>>maze[i][j];
            }
        }
        for(i=0;i<n;i++)
        {
            for(j=0;j<m;j++)
            {
                if(maze[i][j]=='*')add(i,j);
            }
        }
        int k=0;
        for(i=0;i<n;i++)
        {
            for(j=0;j<m;j++)
            {
                if(maze[i][j]=='.'&&d[i][j]!=0){k=1;break;}
                else if(maze[i][j]=='.')continue;
                else if(maze[i][j]=='*')continue;
                else if((int)(maze[i][j])-48!=d[i][j]){k=1;break;}
            }
        }
        if(k==0)cout<<"YES"<<endl;
        else cout<<"NO"<<endl;
    }
    return 0;
}

阅读更多
文章标签: ACM
个人分类: CF
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

不良信息举报

#483(div.2) B. Minesweeper

最多只允许输入30个字

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭