提交时间:2023-07-22 18:19:30

运行 ID: 24348

#include "bits/stdc++.h" using namespace std; int n; int s[45][45]; int st[45][45]; int dx[4]={0,-1,0,1}; int dy[4]={-1,0,1,0}; void dfs(int x,int y){ for(int i=0;i<4;i++){ int nx=x+dx[i]; int ny=y+dy[i]; if(nx>=0&&nx<=n+1&&ny>=0&&ny<=n+1&&s[nx][ny]==0&&st[nx][ny]==0){ st[nx][ny]=1; dfs(nx,ny); } } } int main(){ cin>>n; for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++)cin>>s[i][j];} dfs(0,0); for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++){ if(s[i][j]==1)cout<<"1 "; else if(st[i][j]==1)cout<<"0 "; else cout<<"2 ";} cout<<endl;} }