codeforces 948A Protect Sheep

# Protect Sheep

A. Protect Sheep

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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...

Note

In the first example, we can split the pasture into two halves, one containing wolves and one containing sheep. Note that the sheep at (2,1) is safe, as wolves cannot move diagonally.

In the second example, there are no empty spots to put dogs that would guard the lone sheep.

In the third example, there are no wolves, so the task is very easy. We put a dog in the center to observe the peacefulness of the meadow, but the solution would be correct even without him.

嗨呀，鸽了好多天再来写博客，惭愧惭愧。

题目大意

有一个R*C的矩阵，有的单元住着一只羊，有的单元住着一条狼，狼可以上下左右随便走，如果走到羊的格子，就会把羊吃掉，因此让你安排几条狗保护羊，狼不可以通过狗的格子，问你是否可以保护所有的羊（狗可以随便无限安排），如果可以打印出一种安排方法

思路

很简单的思路，如果羊挨着狼，那么，无论狗怎么放，羊都会被吃掉，否则直接在羊的上下左右四周安排狗守着，狼就无法吃到狗了呀。签到题，就是这么简单。

代码

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<string>
#include<vector>
#include<stack>
#include<set>
#include<map>
#include<queue>
#include<algorithm>
#define ll long long
using namespace std;
const int maxn=505;
char im[maxn][maxn];
int r,c;

int main(){
    // freopen("test.txt","r",stdin);
    //freopen("test.out","w",stdout);

    while(~scanf("%d %d",&r,&c)){
        memset(im,'.',sizeof(im));
        for(int i=1;i<=r;i++){
            getchar();
            for(int j=1;j<=c;j++){
                scanf("%c",&im[i][j]);
                // printf("%c",im[i][j]);
            }
            // printf("\n");
        }
        int flag=0;
        for(int i=1;i<=r;i++){
            for(int j=1;j<=c;j++){
                if(im[i][j]=='S'){
                    if(im[i][j+1]=='W'||im[i][j-1]=='W'||im[i+1][j]=='W'||im[i-1][j]=='W'){
                        flag=1;
                        printf("No\n");
                        break;
                    }
                    else{
                        if(im[i][j+1]=='.')
                            im[i][j+1]='D';
                        if(im[i][j-1]=='.')
                        im[i][j-1]='D';
                        if(im[i-1][j]=='.')
                        im[i-1][j]='D';
                        if(im[i+1][j]=='.')
                        im[i+1][j]='D';
                    }
                }
            }
            if(flag){
                break;
            }
        }
        if(!flag){
            printf("Yes\n");
            for(int i=1;i<=r;i++){
                for(int j=1;j<=c;j++){
                    printf("%c",im[i][j]);
                }
                printf("\n");
            }
        }
    }
    return 0;
}