CodeForces 377A Maze

最新推荐文章于 2023-03-26 09:58:31 发布

原创最新推荐文章于 2023-03-26 09:58:31 发布 · 414 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

搜索专栏收录该内容

31 篇文章

订阅专栏

本文介绍了一个迷宫填充问题，即如何在保持所有空地连通的前提下，在初始连通的空地上放置一定数量的墙壁。通过深度优先搜索(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 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.

Examples

Input

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

Output

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

Input

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

Output

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

题目大意：给定一个n*m的地图，这个地图初始化有s个空地，并且这s个空地是连通的。现在要求找到一种方案放k个的墙到这个地图使得剩下的s-k个点还是连通的

因为初始化的地图是一个连通的，要求s-k个点也是连通的。那么我们只要对这个图搜索到s-k个连通的点，然后剩下的k个点全部放墙就可以了

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
char map[510][510];
bool book[510][510];
int n,m,k;
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
void dfs(int x,int y){
	if(x<0||y<0||x>=n||y>=m) return;
	if(map[x][y]!='.') return;
	if(book[x][y]) return;
	book[x][y]=true;
	for(int i=0;i<4;i++){
		dfs(x+dx[i],y+dy[i]);
	}
	if(k){
		map[x][y]='X';
		k--;
	}
}
int main(){
	while(~scanf("%d%d%d",&n,&m,&k)){
		getchar();
		memset(book,false,sizeof(book));
		for(int i=0;i<n;i++) scanf("%s",map[i]);
		for(int i=0;i<n;i++){
			for(int j=0;j<m;j++){
				if(k==0) break;
				dfs(i,j);
			}
			if(k==0) break;
		}
		for(int i=0;i<n;i++) puts(map[i]);
	}
}