#C. 填涂颜色

最新推荐文章于 2024-08-15 23:06:57 发布

一只土豆熊

最新推荐文章于 2024-08-15 23:06:57 发布

阅读量229

点赞数 4

分类专栏：题目文章标签： c语言深度优先算法

本文链接：https://blog.csdn.net/2301_76217337/article/details/140460096

版权

题目专栏收录该内容

41 篇文章 0 订阅

订阅专栏

Code:

#include<bits/stdc++.h>
using namespace std;
int a[100][100], b[100][100] = { 0 };
int n, x, y;
void dfs(int x, int y){
    if (x > n || x<1 || y>n || y < 1 || a[x][y] != 0) 
        return;
    a[x][y] = 1;
    dfs(x + 1, y);
    dfs(x - 1, y);
    dfs(x, y + 1);
    dfs(x, y - 1);
}
int main(){
    cin >> n;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++){
            cin >> a[i][j];
            if (a[i][j] == 1) b[i][j] = -1;
        }
    int flag = 0;
    for (int i = 1; i <= n; i++){
        if (a[i][1] != 1) dfs(i, 1);
        if (a[i][n] != 1) dfs(i, n);
    }
    for (int i = 1; i <= n; i++){
        if (a[1][i] != 1) dfs(1, i);
        if (a[n][i] != 1) dfs(n, i);
    }
    for (int i = 1; i <= n; i++){
        for (int j = 1; j <= n; j++){
            if (b[i][j] == -1) printf("1 ");
            else
                if (a[i][j] == 0) printf("2 ");
                else printf("0 ");
        }
        printf("\n");
    }
    return 0;
}