Codeforces Round #470 (rated, Div. 2, based on VK Cup 2018 Round 1) A. Protect Sheep

A. Protect Sheep

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.

Examples

input

Copy

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

output

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

input

Copy

1 2
SW

output

No

input

Copy

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

output

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

题意：给你一个n*m地图，里面放了两种生物，羊，狼，现在你有无数个狗，让你在空白位置养狗，用来防止狼吃羊，问你怎么放可以保证一只羊也不少，否则就No。

思路：简单签到，判断每只羊的四个方向有没有狼，有则No，如果都没有，接下来全地图养苟，输出地图即可。

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<string>
#include<map>
#include<vector>
#include<queue>
#include<stack>
#define ll long long
using namespace std;
char s[550][550];
ll n,m,f;
int main()
{
    while(~scanf("%lld%lld",&n,&m))
    {
        memset(s,0,sizeof(s));
        for(ll i=1;i<=n;i++)
        {
            scanf("%s",s[i]+1);
        }
        for(ll i=1;i<=n;i++)
        {
            for(ll j=1;j<=m;j++)
            {
                f=0;
                if(s[i][j]=='S')   //判断羊的四个方向有没有狼
                {
                    if(s[i-1][j]=='W')f=1;
                    if(s[i][j-1]=='W')f=1;
                    if(s[i+1][j]=='W')f=1;
                    if(s[i][j+1]=='W')f=1;
                }
                if(f==1)break;
            }
            if(f==1)break;
        }
        if(f==1)printf("No\n");
        else
        {
            printf("Yes\n");
            for(ll i=1;i<=n;i++)
            {
                for(ll j=1;j<=m;j++)
                {
                    if(s[i][j]=='.')printf("D");   //空白地方全部养狗
                    else printf("%c",s[i][j]);
                }
                printf("\n");
            }
        }
    }
    return 0;
}