题目链接
题目大意:给定地图,然后把地图中被1围起来的0变为2
解题思路:给点的地图为n * n,我们先将地图四周扩大为n+1*n+1填充0,然后我们从(1,1)出发用dfs遇见1停止,遇见0标记,地图中被1围起来的0我们用dfs进不去所以未标记,最后如果!flag[i][j]&&mapp[i][j]==0 我们输出2,否者就输出mapp[i][j]
注:将地图四周扩大为n+1*n+1填充0,是为了防止边缘都是1的情况。
#include<iostream>
#include<queue>
using namespace std;
const int N = 40;
int mapp[N][N],flag[N][N];
int n;
int dx[] = {1,-1,0,0};
int dy[] = {0,0,1,-1};
void dfs(int x,int y)
{
flag[x][y] = 1;
for(int i=0;i<4;i++)
{
int nx = x + dx[i];
int ny = y + dy[i];
if(nx>=0&&ny>=0&&nx<=n+1&&ny<=n+1&&!flag[nx][ny]
&&mapp[nx][ny]!=1)
{
flag[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>>mapp[i][j];
for(int i=0;i<=n+1;i++)
{
mapp[0][i] = 0;
mapp[n+1][i] = 0;
mapp[i][0] = 0;
mapp[i][n+1] = 0;
}
dfs(1,1);
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
if(!flag[i][j]&&mapp[i][j]==0) cout<<2<<" ";
else cout<<mapp[i][j]<<" ";
}
cout<<endl;
}
}