洛谷 P1162. 填涂颜色
原题链接
中等
作者:
我是java同学
,
2024-01-14 20:30:39
,
所有人可见
,
阅读 36
#include <bits/stdc++.h>
using namespace std;
const int N = 33;
int n;
int g[N][N];
int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};
void dfs(int x, int y) {
g[x][y] = 3;
for (int i = 0; i < 4; i ++ ) {
int a = x + dx[i], b = y + dy[i];
if (a < 0 || a >= n || b < 0 || b >= n) continue;
if (!g[a][b]) dfs(a, b);
}
}
int main() {
cin >> n;
for (int i = 0; i < n; i ++ )
for (int j = 0; j < n; j ++ )
cin >> g[i][j];
for (int i = 0; i < n; i ++ )
for (int j = 0; j < n; j ++ )
if (g[i][j] == 0) {
if (i == 0 || i == n - 1) dfs(i, j);
if (j == 0 || j == n - 1) dfs(i, j);
}
for (int i = 0; i < n; i ++ )
for (int j = 0; j < n; j ++ )
if (g[i][j] == 0) g[i][j] = 2;
else if (g[i][j] == 3) g[i][j] = 0;
for (int i = 0; i < n; i ++ ) {
for (int j = 0; j < n; j ++ )
cout << g[i][j] << ' ';
cout << endl;
}
return 0;
}