练习11，马的遍历【广搜BFS】

题目链接：P1443 马的遍历 - 洛谷 | 计算机科学教育新生态 (luogu.com.cn)

#include<bits/stdc++.h>
using namespace std;
#define lint long long
int n,m,ans[410][410]={0},d[410][410]={0};
const int xx[8]={-1,-2,-2,-1,1,2,2,1};
const int yy[8]={-2,-1,1,2,2,1,-1,-2};
vector<int> vx,vy,vstep;

int main(){
    int X,Y;
    cin >> n >> m >> X >> Y;
    memset(ans,-1,sizeof(ans));
    d[X][Y]=1;
    vx.push_back(X);
    vy.push_back(Y);
    vstep.push_back(0);
    int x,y;
    while(vx.empty()==0){
        x=vx.front();
        y=vy.front();
        ans[x][y]=vstep.front();
        vx.erase(vx.begin());
        vy.erase(vy.begin());
        vstep.erase(vstep.begin());
        for(int i=0;i<8;i++){
            if(x+xx[i]>0 && y+yy[i]>0 && x+xx[i]<=n && y+yy[i]<=m && d[x+xx[i]][y+yy[i]]==0){
                vx.push_back(x+xx[i]);
                vy.push_back(y+yy[i]);
                d[x+xx[i]][y+yy[i]]=1;
                vstep.push_back(ans[x][y]+1);
            }
        }
    }
    //下面是输出部分
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            if(ans[i][j]==-1) {cout << "-1   "; continue;}
            int w=ans[i][j],add=0;
            do{
                add++;
                w/=10;
            }while(w>0);
            cout << ans[i][j];
            for(int k=1;k<=5-add;k++) cout << ' ';
        }
        cout << endl;
    }
    return 0;
}