CF - 377A. Maze - dfs+模拟

1.题目描述：

A. Maze

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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

2.题意概述：

给你一个房间，已经放了几张桌子，要你在空的地方继续放k张，输出放完以后的图。

3.解题思路：

直接dfs扫完以后模拟就好

4.AC代码：

#include <cstdio>
#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
#include <functional>
#include <cmath>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <ctime>
#define INF 0x7fffffff
#define maxn 505
#define eps 1e-6
#define pi acos(-1.0)
#define e 2.718281828459
#define mod (int)1e9 + 7;
using namespace std;
char mp[maxn][maxn];
bool vis[maxn][maxn];
int n, m, k;
int dir[4][2] = { {0 , 1}, {1, 0}, {0, -1}, {-1, 0} };
void dfs(int x, int y)
{
	if (x < 0 || x >= n || y < 0 || y >= m || mp[x][y] != '.' || vis[x][y]) 
		return;
	vis[x][y] = true;
	for (int i = 0; i < 4; i++)
	{
		int dx = x + dir[i][0];
		int dy = y + dir[i][1];
		dfs(dx, dy);
	}
	if (k) 
	{
        mp[x][y] = 'X';
        k--;
    }
}

int main()
{
    #ifndef ONLINE_JUDGE
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
        long _begin_time = clock();
    #endif

	while (scanf("%d%d%d", &n, &m, &k) != EOF)
	{
		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++)
			printf("%s\n", mp[i]);
	}

    #ifndef ONLINE_JUDGE
        long _end_time = clock();
        printf("time = %ld ms\n", _end_time - _begin_time);
    #endif
	return 0;
}