CF377A Maze

难度：3
知识点：搜索

题意：给定一个地图，所有的空地都四联通，现在让你把k个空地变成墙，然后剩下的空地还保持联通，输出你修改之后的地图，这个题正确答案有很多，取决于你的写法，我用的是bfs，并且从左上角的空地开始，思路很简单，把所有空地标记层数，然后依次把最外层的空地变成障碍物就行了，dfs貌似也能写，但是还没有尝试

#include <bits/stdc++.h>

#define fi first
#define se second
#define pb push_back
#define mk make_pair
#define sz(x) ((int) x.size())
#define all(x) (x).begin(), (x).end()

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pa;

const int N = 505;

int n, m, k;
int dist[N][N];
int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};
int rec[N][N];
vector<pa> vec;
string s[N];

void bfs(pa v) {
    queue<pa> q;
    q.push(v);
    dist[v.fi][v.se] = 1;
    while (!q.empty()) {
        pa now = q.front(); q.pop();
        vec.pb(now);
        for (int i = 0; i < 4; i++) {
            int x = now.fi + dx[i], y = now.se + dy[i];
            if (x < 0 || y < 0 || x >= n || y >= m || dist[x][y] || s[x][y] == '#') continue;
            q.push(mk(x, y)); dist[x][y] = dist[now.fi][now.se] + 1;
        }
    }
}

int main() {
    cin >> n >> m >> k;
    for (int i = 0; i < n; i++) cin >> s[i];
    int ok = 0;
    for (int i = 0; i < n && !ok; i++) {
        for (int j = 0; j < m && !ok; j++) {
            if (s[i][j] == '.') { bfs(mk(i, j)); ok = 1; }
        }
    }
    for (int i = sz(vec) - 1; i > sz(vec) - k - 1; i--) {
        pa now = vec[i];
        rec[now.fi][now.se] = 1;
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            cout << (rec[i][j] ? 'X' : s[i][j]) << (j == m - 1 ? "\n" : "");
        }
    }
    return 0;
}