17-比赛2 C - Maze （dfs）

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

Examples

Input

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

Output

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

Input

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

Output

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

题意：
 插入 k 个 X 且保持所有的 '.' 保持贯通
====================================================================================================================================================
怎么样才能使插入的 X 没有阻断路的连通，，想一想DFS，不撞南墙不回头的理论，只要沿着一个点一路走到底，直到不能走为止，那么这个末端放上X一定不会阻断其它'.'的连贯
如果所有末端 插入完毕之后，还有X没有放入，那么末端之后紧挨着的点就变成了末端，根据DFS走到末端后会原路返回，那么剩下的X跟着原路返回时插入就行了。

====================================================================================================================================================
代码：

 #include<bits/stdc++.h>
 using namespace std;
 char Map[][];
 bool book[][];
 int n,m,k;
 void dfs(int x,int y)
 {
     if(x<||x>=n||y<||y>=m) return;
     if(Map[x][y]!='.'||book[x][y]==) return ;
     book[x][y]=;
     for(int i=;i<=;i++)
     {   //四个方向
         if(i==)  dfs(x+,y);
         if(i==)  dfs(x-,y);
         if(i==)  dfs(x,y+);
         if(i==)  dfs(x,y-);
     }
     //当遍历到底了之后，即循环了四次无法继续走下去时
     if(k!=)
         Map[x][y]='X',k--;
 }
 int main()
 {
       scanf("%d%d%d",&n,&m,&k);
         for(int i=;i<n;++i)
             scanf("%s",Map[i]);

         for(int i=;i<n;++i)
             {
                 for(int j=;j<m;j++)
                 {
                     dfs(i,j);
                     if(k==) break;
                 }
                 if(k==) break;
             }
         for(int i=;i<n;i++)
             puts(Map[i]);
     return ;
 }