Nightmare（BFS)

#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#define size 10
#define Max 100000
using namespace std;
struct point{
    int x,y,now,l;
};
int dx[]={0,1,-1,0},dy[]={-1,0,0,1};
int map[size][size];
int step[size][size],ti[size][size];
int n,m;
point start;
int x,y,now,l;
bool flag;
void bfs()
{
    queue<point> s;
    s.push(start);
    int i,j;
    point next;
    while(!s.empty())
    {
        point pos=s.front();
        s.pop();
        if(map[pos.x][pos.y]==3)    {flag=1;cout<<pos.l<<endl;break;}
        if(pos.now>1)
        {
            for(i=0;i<4;i++)
            {
                x=pos.x+dx[i];
                y=pos.y+dy[i];
                now=pos.now-1;
                l=pos.l+1;
                if((x>=0&&y>=0&&x<n&&y<m&&map[x][y]!=0))
                {
                    if(map[x][y]==4)    {now=6;map[x][y]=0;}
                    next.x=x,next.y=y,next.now=now,next.l=l;
                    s.push(next);
                }
            }
        }
    }
}
int main()
{
    int T,i,j;
    freopen("in.txt","r",stdin);
    cin>>T;
    while(T--)
    {
        cin>>n>>m;
        for(i=0;i<n;i++)
            for(j=0;j<m;j++)
            {
                cin>>map[i][j];
                if(map[i][j]==2)    {start.x=i,start.y=j;}
            }
        for(i=0;i<size;i++)
            for(j=0;j<size;j++)
                step[i][j]=Max;
        flag=0;
        start.now=6,start.l=0;
        bfs();
        if(!flag)    cout<<-1<<endl;
    }
}