# include map # include cmath # include queue # include cstdio # include string # include cstring # iostream # includealgorition include list # include deque # include unordered _ map # include unordered _ setusingnamespace bool flag [ 1001 ] [ 1001 ]={0} int dir _ x [4]={-1,0,0,1 }; int dir _ y [4]={ 0,1,- 1,0 }; void find _ RES (矢量向量数据,int x,int y ) {for(intI=0; i 4; I ) {int xx=x dir_x[i]; int yy=y dir_y[i]; //cout xx ' y='yyendl; if(xx=0xxdata.size ) yy=0 yy data.size ) flag[xx][yy]==0 data[x][y]==0) { flag [ xx ] [ YY ]=1//find_RES(data,xx,yy ); }}}int main () {string S; int N; cin N; 矢量向量(ndata (n,vectorint ) n ); for(intI=0; i N; I ) for(intj=0; j N; j({CINdata[I][j]; }for(intI=0; i N; I ) {int j=0; if(data[j][I]==0flag[j][I]==0) {flag[i][j]=1; find _ RES (数据,j,I ); (if ) data[I][j]==0flag[I][j]==0) {flag[i][j]=1; find _ RES (数据,I,j ); (}j=N - 1; if(data[I][j]==0flag[I][j]==0) {flag[i][j]=1; find _ RES (数据,I,j ); }if(data[j][I]==0flag[j][I]==0) {flag[i][j]=1; find _ RES (数据,j,I ); }for(intI=0; i N; I ) for(intj=0; j N; j () cout(data[I][j]|flag[I][j]==0) '; }cout endl; }返回0; }