警示后人

willAK @ 2024-07-29 15:12:01

by Wavestars @ 2024-10-21 12:54:51

开大点后变MLE#5了

by lr20121008 @ 2024-11-18 20:05:23

6

by lr20121008 @ 2024-11-18 20:09:21

满分代码

#include <bits/stdc++.h>
using namespace std;
int a[32][32],b[32][32];
int dx[5]={0,-1,1,0,0};
int dy[5]={0,0,0,-1,1};
int n,i,j;
void dfs(int p,int q){
    int i;
    if (p<0||p>n+1||q<0||q>n+1||a[p][q]!=0) return;
    a[p][q]=1;
    for (i=1;i<=4;i++) dfs(p+dx[i],q+dy[i]);
}
int main(){
    cin>>n;
    for (i=1;i<=n;i++)
        for (j=1;j<=n;j++){
            cin>>b[i][j];
            if (b[i][j]==0) a[i][j]=0;
            else a[i][j]=2;
        }
    dfs(0,0);
    for (i=1;i<=n;i++){
        for (j=1;j<=n;j++)
        if (a[i][j]==0) cout<<2<<' ';
        else cout<<b[i][j]<<' ';
        cout<<'\n';
    }
}

别再警示后人了，求关注