Maze CodeForces

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

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
#define inf 0x3f3f3f3f
using namespace std;char m[505][505];
int l,r,k;void dfs(int x,int y)
{if(x<0||y<0||x>=l||y>=r){return ;}if(m[x][y]=='X'){if(k==0)return ;else{k++;m[x][y]='.';dfs(x-1,y);dfs(x,y-1);dfs(x,y+1);dfs(x+1,y);}}
}int main()
{int i,j,x,y;while(~scanf("%d %d %d\n",&l,&r,&k)){for(i=0;i<l;i++){for(j=0;j<r;j++){scanf("%c",&m[i][j]);if(m[i][j]=='.'){k--;m[i][j]='X';x=i;y=j;}}getchar();}dfs(x,y);for(i=0;i<l;i++)printf("%s\n",m[i]);}return 0;
}

Maze CodeForces - 377A相关推荐

CODEFORCES 377A
http://codeforces.com/problemset/problem/377/A D - Maze CodeForces - 377A http://blog.csdn.net/keshu ...
Solve The Maze CodeForces - 1365D（贪心+dfs）
Vivek has encountered a problem. He has a maze that can be represented as an n×m grid. Each of the g ...
D. Solve The Maze Codeforces Round #648 (Div. 2)
D. Solve The Maze Vivek has encountered a problem. He has a maze that can be represented as an n×m g ...
HZNU Training 4 for Zhejiang Provincial Collegiate Programming Contest 2019
今日这场比赛我们准备的题比较全面,二分+数论+最短路+计算几何+dp+思维+签到题等.有较难的防AK题,也有简单的签到题.为大家准备了一份题解和AC代码. A - Meeting with Alien ...
codeforces 378C MAZE
D - Maze Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u Submit St ...
【Codeforces - 378C】Maze（dfs，思维）
题干: Pavel loves grid mazes. A grid maze is an n × m rectangle maze where each cell is either empty, ...
CodeForces 377 A. Maze
DFS找末端的空地变成墙...... A. Maze time limit per test 2 seconds memory limit per test 256 megabytes input s ...
CodeForces - 1293C NEKO's Maze Game(思维，水题)
题目链接:点击查看题目大意:给出一个2*n大小的矩阵,现在有m次操作,每次操作将某一个方格的状态置反,这里的每个方块都有两种状态,一种状态是可通行状态,另一种是不可通行状态,初始时所有方块都是可通行 ...
Codeforces Round #222 (Div. 2): C. Maze（BFS）
题意: 给你一个n*m的迷宫,'.'是路,'#'是墙,输入保证所有的'.'构成一个联通块,要求为这个迷宫再添加k面墙,使得剩下所有的'.'仍然构成一个联通块思路:反过来处理,先将所有的'.'全部变成 ...
codeforces D. Solve The Maze
题目题意: 你有一个地图,总共有 4 4 4种符号,'.','#',' G G G',' B B B',分别代表着路,墙,好人,坏人,现在你可以将路变成墙,问最后是否有一种方案使得坏人走不到 n , ...

Maze CodeForces - 377A

Maze CodeForces - 377A相关推荐

最新文章

热门文章