Submission #76267529

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
const int MAX_SIZE = 1e6 + 10;
inline int id(int x, int y, int w) {
    return x * w + y;
}
int main() {
    int h, w;
    cin >> h >> w;
    vector<char> grid(h * w);
    vector<int> dist(h * w, -1);
    queue<int> q;
    const int fx[] = {-1, -1, -1, 0, 0, 1, 1, 1};
    const int fy[] = {-1, 0, 1, -1, 1, -1, 0, 1};
    for (int i = 0; i < h; ++i) {
        string s;
        cin >> s;
        for (int j = 0; j < w; ++j) {
            int idx = id(i, j, w);
            grid[idx] = s[j];
            if (s[j] == '#') {
                dist[idx] = 0;
                q.push(idx);
            }
        }
    }
    while (!q.empty()) {
        int curr = q.front();
        q.pop();
        int x = curr / w;
        int y = curr % w;
        for (int d = 0; d < 8; ++d) {
            int nx = x + fx[d];
            int ny = y + fy[d];
            if (nx >= 0 && nx < h && ny >= 0 && ny < w) {
                int nidx = id(nx, ny, w);
                if (dist[nidx] == -1) {
                    dist[nidx] = dist[curr] + 1;
                    q.push(nidx);
                }
            }
        }
    }
    for (int i = 0; i < h; ++i) {
        string line;
        for (int j = 0; j < w; ++j) {
            int idx = id(i, j, w);
            if (dist[idx] == -1) {
                line += '.';
            } else if (dist[idx] % 2 == 0) {
                line += grid[idx];
            } else {
                line += (grid[idx] == '#' ? '.' : '#');
            }
        }
        cout << line << '\n';
    }

    return 0;
}

Submission Info

Judge Result