CODE： 游乐园的迷宫

#include<iostream>
#include<queue>
using namespace std;

const int maxn = 205;
int mp[maxn][maxn] = {0};
int vis[maxn][maxn] = {0};
int n,m;
struct Node{
    int x,y;
    int step;
};
int dir[12][2] = {{-1,-2},{1,-2},{-2,-1},{2,-1},{-2,1},{2,1},{1,2},{-1,2},{-2,2},{2,2},{-2,-2},{2,-2}};
int spe[8][2] = {{-1,1},{-1,0},{-1,-1},{0,1},{0,-1},{1,1},{1,-1},{1,0}};
int jude = 0;
int operate(int &x,int &y,int step,int flag)
{
    if(flag)
    {
        x+=dir[step][0];
        y+=dir[step][1];
    }
    else
    {
        x+=spe[step][0];
        y+=spe[step][1];
    }

    if(x<=0||x>n||y<=0||y>m||!mp[x][y]||vis[x][y])
    {
        return 0;
    }
    return 1;
}
void bfs()
{
    queue<Node> q;
    q.push((Node){1,1,0});  
    while(!q.empty())
    {
        Node n = q.front(); 
        q.pop();
        int a,b;
        if(mp[n.x][n.y]==3)
        {
            cout << n.step<<endl;
            jude = 1;
            return ;
        }
        for(int i = 0; i < 12; i++)
        {
            a = n.x;
            b = n.y;
            if(!operate(a,b,i,1))
                continue;
            q.push((Node){a,b,n.step+1});
            vis[a][b] = 1;
        }
        a = n.x;
        b = n.y;
        if(mp[a][b]==2)
        {
            for(int j = 0; j < 8; j++)
            {
                if(!operate(a,b,j,1))
                    continue;
                q.push((Node){a,b,n.step+1});
                vis[a][b] = 1;
            }
        }   
    }   
    return ;
}
int main()
{
    cin >> n >> m;
    for(int i =1; i <= n; i++)
    {
        for(int j = 1; j<=m; j++)
        {
            char temp;
            cin >> temp;
            if(temp=='#')
                mp[i][j] = 0;
            if(temp=='.')
                mp[i][j] = 1;
            if(temp=='*')
                mp[i][j] = 2;
            if(temp=='@')
                mp[i][j] = 3;
        }
    }
    bfs();
    if(!jude)
    {
        cout << "-1" << endl;
    }
     return 0;
 }