【CodeForces】CF377A Maze

题目地址：

https://www.luogu.com.cn/problem/CF377A

题面翻译：
题目描述：
小P非常的喜欢方格迷宫。方格迷宫是一个$n\times m$的由墙和空地构成的长方形方阵。只有当两点满足四联通条件时才能走过去。

小P画了一个迷宫，里面所有的空地都是四连通的。但闲着没事干的小P认为自己画的迷宫里小墙太多了很难看，所以他希望能够通过把迷宫中k个格子从空地变成墙但不破坏整张图的连通性（即仍然保持所有空地在一个四连通块中）。但是小P太蠢了做不来，请你帮助他。

输入：
第一行$n,m,k$（描述如题）
第二到$n+1$行：
每行$m$个字符，分别是’.‘或’#'。 '.‘表示空地，’#‘表示墙。
输出：
把整张图原样打出来，但是被你修改的格子输出’X’。

题目描述：
Pavel loves grid mazes. A grid maze is an $n\times 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.

输入格式：
The first line contains three integers $n$ , $m$ , $k$ ($1\le n,m\le 500$ , $0\le k\le 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.

输出格式：
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.

可以用DFS，遍历矩阵，当遍历到空地的时候，如果$k$个造墙指标还没有用掉，则开始DFS，回溯的时候将空地变成新墙，这样就能保证空地仍然连通。代码如下：

#include <iostream>
#include <cstring>
using namespace std;

const int N = 510;
int n, m, k, cnt;
int d[] = {-1, 0, 1, 0, -1};
char a[N][N];
bool vis[N][N];

void dfs(int x, int y) {
  vis[x][y] = true;
  for (int i = 0; i < 4; i++) {
    int nx = x + d[i], ny = y + d[i + 1];
    if (0 <= nx && nx < n && 0 <= ny && ny < m && !vis[nx][ny] && a[nx][ny] != '#')
      dfs(nx, ny);
  }

  if (cnt) {
    a[x][y] = 'X';
    cnt--;
  }
}

int main() {
  scanf("%d%d%d", &n, &m, &k);
  for (int i = 0; i < n; i++)
    scanf("%s", a[i]);
  
  cnt = k;
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++)
      if (cnt && a[i][j] == '.') {
        memset(vis, 0, sizeof vis);
        dfs(i, j);
      }
  
  for (int i = 0; i < n; i++)
    puts(a[i]);
}

时空复杂度$O(mn)$。