codeforces 377A Maze(广搜)

Pavel loves grid mazes. A grid maze is an n × m rectangle maze where each cell is either empty, or is a wall. You can go from one cell to another only if both cells are empty and have a common side.


Pavel drew a grid maze with all empty cells forming a connected area. That is, you can go from any empty cell to any other one. Pavel doesn't like it when his maze has too little walls. He wants to turn exactly k empty cells into walls so that all the remaining cells still formed a connected area. Help him.


Input
The first line contains three integers n, m, k (1 ≤ n, m ≤ 500, 0 ≤ k < s), where n and m are the maze's height and width, correspondingly, k is the number of walls Pavel wants to add and letter s represents the number of empty cells in the original maze.


Each of the next n lines contains m characters. They describe the original maze. If a character on a line equals ".", then the corresponding cell is empty and if the character equals "#", then the cell is a wall.


Output
Print n lines containing m characters each: the new maze that fits Pavel's requirements. Mark the empty cells that you transformed into walls as "X", the other cells must be left without changes (that is, "." and "#").


It is guaranteed that a solution exists. If there are multiple solutions you can output any of them.


Example
Input
3 4 2
#..#
..#.
#...
Output
#.X#
X.#.
#...
Input
5 4 5
#...
#.#.
.#..
...#
.#.#
Output
#XXX
#X#.
X#..
...#

.#.#

题意：一个n*m的迷宫，其中 "." 是空地，#是墙，现在给出一个k，把k个空地变成墙后所有的空地依然连通

设改变之前空地的个数为s，那么只要用广搜找到s-k个连通的点就好，给他们的位置做好标记，最后输出地图的时候如果有标记就正常输出“.”，没有则输出“X”

#include<cstdio>
#include<queue>
using namespace std;
const int M = 505;
struct Node
{
    int x, y;
};
int cnt=0, sum=0;
int k, n, m;
bool book[M][M];
char mapp[M][M];
int mv[4][2] = {{0,-1},{0,1},{1,0},{-1,0}};
void bfs(int x, int y)
{
    queue<Node> q;
    int xt, yt;
    Node tmp, next;
    tmp.x = x;
    tmp.y = y;
    book[x][y] = true;
    cnt=1;
    q.push(tmp);
    while(!q.empty())
    {
        tmp = q.front();
        q.pop();
        for(int i=0;i<4;i++)
        {
            xt = tmp.x + mv[i][0];
            yt = tmp.y + mv[i][1];
            if(xt<1||xt>n||yt<1||yt>m)
                continue;
            if(!book[xt][yt]&&mapp[xt][yt]=='.')
            {
                if(cnt==sum-k)//cnt判断的位置很重要
                    return;
                book[xt][yt] = true;
                cnt++;
                next.x = xt;
                next.y = yt;
                q.push(next);
            }
        }
    }
}
int main()
{
    int x=-1, y=-1;//防止出现没有空地的情况
    scanf("%d%d%d", &n, &m, &k);
    getchar();
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
            scanf("%c", &mapp[i][j]);
            if(mapp[i][j]=='.')
            {
                sum++;
                x = i;
                y = j;
            }
        }
        getchar();
    }
    if(x!=-1&&y!=-1)//如果图中存在空地就继续广搜，之前RE了一次，怕是这里的问题
    {
        bfs(x, y);
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=m;j++)
            {
                if(mapp[i][j]=='.'&&book[i][j])
                    printf(".");
                else if(mapp[i][j]=='.')
                    printf("X");
                else
                    printf("#");
            }
            printf("\n");
        }
    }
    else
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=m;j++)
                printf("%c", mapp[i][j]);
            printf("\n");
        }
    return 0;
}