广搜标准文

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;


const int maxn=60;
int n,m,p,q;
queue<int>qx,qy;
int dx[5]={0,1,-1,0,0},dy[5]={0,0,0,-1,1};
int dis[maxn][maxn];
int vis[maxn][maxn];
int map[maxn][maxn];

inline int read(){
    int x=0,fl=1;char c=getchar();
    while(c<'0' || c>'9'){if(c=='-')fl=-1;c=getchar();}
    while(c<='9' && c>='0'){x=x*10+(int)(c-'0');c=getchar();}
    return x*fl;
}

inline void bfs(){
    qx.push(1),qy.push(1);
    vis[1][1]=1;
    while(!qx.empty() && !qy.empty()){
        int nx=qx.front(),ny=qy.front();
        qx.pop(),qy.pop();
        for(int i=1;i<=4;++i){
            int x1=nx+dx[i],y1=ny+dy[i];
            if(vis[x1][y1]==1 || x1<0 || x1>n || y1<0 || y1>m || map[x1][y1]==1)
                continue;
            dis[x1][y1]=dis[nx][ny]+1;
            qx.push(x1),qy.push(y1);
            vis[x1][y1]=1;
        }
    }
}

int main(){
    memset(vis,0,sizeof(vis));
    memset(dis,0,sizeof(dis));
    n=read(),m=read();
    for(int i=1;i<=n;++i)
        for(int j=1;j<=m;++j)
            map[i][j]=read();
    p=read(),q=read();
    bfs();
    for(int i=1;i<=n;++i){
        for(int j=1;j<=m;++j)
            printf("%d ",dis[i][j]);
        printf("\n");
    }
    return 0;
}