Pavel loves grid mazes（CodeForce 377A）

最新推荐文章于 2022-09-23 16:59:29 发布

xilihong816

最新推荐文章于 2022-09-23 16:59:29 发布

阅读量1.7k

点赞数 2

分类专栏：深搜

本文链接：https://blog.csdn.net/xilihong816/article/details/50287077

版权

深搜专栏收录该内容

1 篇文章 0 订阅

订阅专栏

Description

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.

Sample Input

Input

3 4 2
#..#
..#.
#...

Output

#.X#
X.#.
#...

Input

5 4 5
#...
#.#.
.#..
...#
.#.#

Output

#XXX
#X#.
X#..
...#
.#.#

题意：

给一个n*m的矩阵，#代表墙，.代表通路，给一个k值，代表需要你将矩阵中k个通路改为X，但是要保证剩下的点依然联通，然后输出改变有的矩阵。

分析：

因为原图是连通的，我们队原图进行递归深搜，从深搜树的底部开始往上删除结点，直至k等于0，这样既达到了删除k个节点也保证了剩余的节点连续。

代码如下：

    #include <iostream>  
    #include <cstdio>  
    #include <cstring>  
      
    using namespace std;  
      
    char mp[512][512];  
    bool vis[512][512];  
      
    int n,m,k;  
      
    void dfs(int x,int y)  
    {  
        if(x<0||x>=n||y<0||y>=m) return ;  
        if(mp[x][y]!='.') return ;  
        if(vis[x][y]) return ;  
        vis[x][y]=true;  
        dfs(x+1,y); dfs(x-1,y);  
        dfs(x,y+1); dfs(x,y-1);  
        if(k) mp[x][y]='X',k--;  
    }  
      
    int main()  
    {  
        scanf("%d%d%d",&n,&m,&k);  
        for(int i=0;i<n;i++) scanf("%s",mp[i]);  
        for(int i=0;i<n&&k;i++)  
        {  
            for(int j=0;j<m&&k;j++)  
            {  
                dfs(i,j);  
            }  
        }  
        for(int i=0;i<n;i++) puts(mp[i]);  
        return 0;  
    }