Layout(拆分约束系统 => 最短路)

最新推荐文章于 2021-05-26 02:55:07 发布

qq_41818544

最新推荐文章于 2021-05-26 02:55:07 发布

阅读量219

点赞数

分类专栏： Codeforces 思维

本文链接：https://blog.csdn.net/qq_41818544/article/details/83926184

版权

思维同时被 2 个专栏收录

10 篇文章 0 订阅

订阅专栏

Codeforces

2 篇文章 0 订阅

订阅专栏

B. Forgery

Student Andrey has been skipping physical education lessons for the whole term, and now he must somehow get a passing grade on this subject. Obviously, it is impossible to do this by legal means, but Andrey doesn't give up. Having obtained an empty certificate from a local hospital, he is going to use his knowledge of local doctor's handwriting to make a counterfeit certificate of illness. However, after writing most of the certificate, Andrey suddenly discovered that doctor's signature is impossible to forge. Or is it?

For simplicity, the signature is represented as an n×mn×m grid, where every cell is either filled with ink or empty. Andrey's pen can fill a 3×33×3 square without its central cell if it is completely contained inside the grid, as shown below.
xxx
x.x
xxx
Determine whether is it possible to forge the signature on an empty n×mn×m grid.

Input

The first line of input contains two integers nn and mm (3≤n,m≤10003≤n,m≤1000 ).

Then nn lines follow, each contains mm characters. Each of the characters is either '.', representing an empty cell, or '#', representing an ink filled cell.

Output

If Andrey can forge the signature, output "YES". Otherwise output "NO".

You can print each letter in any case (upper or lower).

Examples

Input

Copy
3 3
###
#.#
###
Output

Copy
YES
Input

Copy
3 3
###
###
###
Output

Copy
NO
Input

Copy
4 3
###
###
###
###
Output

Copy
YES
Input

Copy
5 7
.......
.#####.
.#.#.#.
.#####.
.......
Output

Copy
YES
Note

In the first sample Andrey can paint the border of the square with the center in (2,2)(2,2) .

In the second sample the signature is impossible to forge.

In the third sample Andrey can paint the borders of the squares with the centers in (2,2)(2,2) and (3,2)(3,2) :
we have a clear paper:
...
...
...
...
use the pen with center at (2,2)(2,2) .
###
#.#
###
...
use the pen with center at (3,2)(3,2) .
###
###
###
###
In the fourth sample Andrey can paint the borders of the squares with the centers in (3,3)(3,3) and (3,5)(3,5) .

题意：男孩子Andrey没写一个字都是形如：

   ###

   #.#

   ###

问他是否能够模仿输入的笔记，如果能输出 YES，否则输出 NO

思路：遍历每一个点，每次以该点为中心，判断是以该点为中心时，是否能够画出既定的图形（在判断时最好用枚举的办法取判断每一个点，不易出错），如果能画出，在另一张空白的纸上在画一遍，最终看两幅画是否相同，如果相同，输出YES，不相同输出 NO。

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>

using namespace std;

const int maxn = 1e3+5;

char maze[maxn][maxn];
char zhi[maxn][maxn];

int n, m;

//判断是否正确 
bool judge(int x, int y){
	if(maze[x-1][y-1] == '#'&&maze[x][y-1] == '#'&&maze[x+1][y-1] == '#'
	&&maze[x-1][y] == '#'&&maze[x+1][y] == '#'
	&&maze[x-1][y+1] == '#'&&maze[x][y+1] == '#'&&maze[x+1][y+1] == '#')
		return true;
	
	else return false;
}

//在另一张纸上画出 
void Update(int x, int y){
	zhi[x-1][y-1] = '#'; zhi[x][y-1] = '#'; zhi[x+1][y-1] = '#';
	zhi[x-1][y] = '#'; zhi[x+1][y] = '#';
	zhi[x-1][y+1] = '#'; zhi[x][y+1] = '#'; zhi[x+1][y+1] = '#';	 
}

int main()
{
	scanf("%d%d", &n, &m);
	memset(zhi, '.', sizeof(zhi));
	for(int i = 0; i < n; i++)
		for(int j = 0; j < m; j++) scanf(" %c", &maze[i][j]);
	
	for(int i = 0; i < n; i++){
		for(int j = 0; j < m; j++){
			if(judge(i, j)) Update(i, j);
		}
	}

	for(int i = 0; i < n; i++){
		for(int j = 0; j < m; j++){
			if(zhi[i][j] == maze[i][j]) continue;
			else{
				printf("NO\n");
				return 0; 
			}
		}
	}
	
	printf("YES\n");
	return 0;
}