[Codeforces 948A] Protect Sheep （DFS）

题目传送门：点击传送

Time limit per test：1 second

Memory limit per test：256 megabytes

Description

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.

如果你能保证全部羊安然无恙，输出Yes并把图输出；否则输出No

Input

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

Output

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

Input

1 2
SW

Output

No

Input

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.

解析：

放置狗（不做数量限制）如何保证羊不被狼吃掉。

前提条件：如果狼在羊上下左右任一位置，那狗肯定保护不了。

如果狗在狼的上下左右，狼走不了就吃不了羊。

如果狗在羊的上下左右，狼靠近不了羊就吃不了。

如果满图是狗，那....（我的做法，对狼比较凶，因为没有数量限制）

代码

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <queue>
char map[505][505];
int m,n,eat;
int dx[4]={1,-1,0,0};
int dy[4]={0,0,-1,1};
int dfs(int x,int y)
{
    int nx,ny,a;
    for(a=0;a<4;a++)
    {
        nx=x+dx[a];
        ny=y+dy[a];
        if(nx<m&&nx>=0&&ny>=0&&ny<n&&map[nx][ny]=='.')
        {
            map[nx][ny]='D';
            dfs(nx,ny);
        }
        if(map[nx][ny]=='S'&&map[x][y]=='W')//如果狼的上下左右有羊 做标记
            eat=-1;
    }
    return 0;
}
int main()
{
        scanf("%d%d",&m,&n);
        getchar();
        int i,j;
        eat=0;
        for(i=0;i<m;i++)//读图 注意getchar()清换行
        {
            for(j=0;j<n;j++)
                 scanf("%c",&map[i][j]);
            getchar();
        }
        for(i=0;i<m;i++)
        {
            for(j=0;j<n;j++)
                if(map[i][j]=='W')//从每一只狼开始走 满图放狗（滑稽）
                    dfs(i,j);
        }
        if(eat==-1)//标记为-1证明不能保护羊
            printf("No\n");
        else
        {
            printf("Yes\n");
            for(i=0;i<m;i++)
            {
                for(j=0;j<n;j++)
                    printf("%c",map[i][j]);
                putchar('\n');
            }
        }
        return 0;
}

碎碎念

比较简单的一道搜索题。如果做最小值限制的时候，题目就变难很多，因为你不能直接上下左右放狼，你需要像样例1那样放置。

有个问题：这题交c++概率WA...后来交的g++    有dl给我解答一下嘛