BFS棋盘 马走日

题目：

思路：

棋盘问题，不求最优，只求能到的最短时间，bfs

代码：

#include<iostream>
#include<queue>
using namespace std;
int n,m, x, y;
int a[8] = { 1,1,-1,-1,2, 2,-2 ,-2};
int b[8] = { 2,-2,2,-2,1,-1 ,1 ,-1};
bool vis[410][410];
int flag[410][410];
int mn ;
struct node {
    int x;
    int y;
    int step;
}pre;
queue<node>q;
void bfs() {
    node next;
    while (q.size()) {
        pre = q.front();
        q.pop();
        for (int i = 0; i < 8; i++) {
            next.x = pre.x + a[i];
            next.y = pre.y + b[i];
            next.step = pre.step + 1;
            if (next.x > 0 && next.x <= n && next.y > 0 && next.y <= m &&!vis[next.x][next.y]) {
                q.push(next);
                flag[next.x][next.y] = next.step;
                vis[next.x][next.y] = 1;
            }
        }
    }

}
int main() {
    cin >> n>>m >> x >> y;
    q.push({ x,y,0 });
    vis[x][y] = 1;
    bfs();
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            if ((i != x || j != y) && flag[i][j] == 0)
                flag[i][j] = -1;
            cout << flag[i][j] << " ";
        }
        cout << endl;
    }
    return 0;
}