CodeForces 377 A. Maze

DFS找末端的空地变成墙。。。。。。

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.

Sample test(s)

input

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

output

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

input

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

output

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

#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;
}

CodeForces 377 A. Maze相关推荐

【Codeforces - 378C】Maze（dfs，思维）
题干: Pavel loves grid mazes. A grid maze is an n × m rectangle maze where each cell is either empty, ...
codeforces 378C MAZE
D - Maze Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u Submit St ...
Codeforces Round #377 (Div. 2) E. Sockets
http://codeforces.com/contest/732/problem/E 题目说得很清楚,每个电脑去插一个插座,然后要刚好的,电脑的power和sockets的值相同才行. 如果不同,还 ...
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 ...
Codeforces Round #377 (Div. 2) 732A B C D E F
蒟蒻只能打div 2 A题水,10和个位数的使用互不影响,所以直接在模10意义下做 1 #include<bits/stdc++.h> 2 using namespace std; 3 i ...
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 , ...

CodeForces 377 A. Maze

CodeForces 377 A. Maze相关推荐

最新文章

热门文章