Protect Sheep

最新推荐文章于 2022-05-11 00:32:04 发布

TherAndI

最新推荐文章于 2022-05-11 00:32:04 发布

阅读量242

点赞数

CC 4.0 BY-SA版权

文章标签： c语言 c++

本文链接：https://blog.csdn.net/TherAndI/article/details/122652148

本文介绍了一个问题，即如何通过放置足够数量的牧羊犬来保护羊群不受狼的攻击。给出了一个具体的解决方案，并提供了示例输入输出，帮助理解如何确保所有羊的安全。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Bob is a farmer. He has a large pasture with many sheep. Recently, he has lost some of them due to wolf attacks. He thus decided to place some shepherd dogs in such a way that all his sheep are protected.

The pasture is a rectangle consisting of R × C cells. Each cell is either empty, contains a sheep, a wolf or a dog. Sheep and dogs always stay in place, but wolves can roam freely around the pasture, by repeatedly moving to the left, right, up or down to a neighboring cell. When a wolf enters a cell with a sheep, it consumes it. However, no wolf can enter a cell with a dog.

Initially there are no dogs. Place dogs onto the pasture in such a way that no wolf can reach any sheep, or determine that it is impossible. Note that since you have many dogs, you do not need to minimize their number.

Input

First line contains two integers R (1 ≤ R ≤ 500) and C (1 ≤ C ≤ 500), denoting the number of rows and the numbers of columns respectively.

Each of the following R lines is a string consisting of exactly C characters, representing one row of the pasture. Here, 'S' means a sheep, 'W' a wolf and '.' an empty cell.

Output

If it is impossible to protect all sheep, output a single line with the word "No".

Otherwise, output a line with the word "Yes". Then print R lines, representing the pasture after placing dogs. Again, 'S' means a sheep, 'W' a wolf, 'D' is a dog and '.' an empty space. You are not allowed to move, remove or add a sheep or a wolf.

If there are multiple solutions, you may print any of them. You don't have to minimize the number of dogs.

Example

Input

6 6
..S...
..S.W.
.S....
..W...
...W..
......

Output

Yes
..SD..
..SDW.
.SD...
.DW...
DD.W..
......

Input

1 2
SW

Output

No

Input

5 5
.S...
...S.
S....
...S.
.S...

Output

Yes
.S...
...S.
S.D..
...S.
.S...

思路：

这道题没有要求狗最少，所以就直接判断🐏的上下左右有没有🐺。

若是没有空地全填🐕，若有就No。

#include<iostream>
#include<cstdio>
using namespace std;
char map[510][510];
int r,c;
int main()
{
	scanf("%d%d",&r,&c);
	for(int i=1;i<=r;i++)
	  for(int j=1;j<=c;j++)
	  cin>>map[i][j];//输入
    for(int i=1;i<=r;i++)
	  for(int j=1;j<=c;j++)
	  {
	  	if(map[i][j]=='S')
	  	{
	  		if(map[i-1][j]=='W'||map[i][j-1]=='W'||map[i+1][j]=='W'||map[i][j+1]=='W')
            //判断
			{
				printf("No\n");
				return 0;
			}
		}
	  }
	  printf("Yes\n");
	for(int i=1;i<=r;i++,puts(""))
	  for(int j=1;j<=c;j++)
	  {
	  	if(map[i][j]=='.') printf("D");//如果是空地，则全变成狗。
		else printf("%c",map[i][j]);//输出。
	  }
	  return 0;
}