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[]={,,-,},dy[]={-,,,};
 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]==)    {flag=;cout<<pos.l<<endl;break;}
         if(pos.now>)
         {
             for(i=;i<;i++)
             {
                 x=pos.x+dx[i];
                 y=pos.y+dy[i];
                 now=pos.now-;
                 l=pos.l+;
                 if((x>=&&y>=&&x<n&&y<m&&map[x][y]!=))
                 {
                     if(map[x][y]==)    {now=;map[x][y]=;}
                     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=;i<n;i++)
             for(j=;j<m;j++)
             {
                 cin>>map[i][j];
                 if(map[i][j]==)    {start.x=i,start.y=j;}
             }
         for(i=;i<size;i++)
             for(j=;j<size;j++)
                 step[i][j]=Max;
         flag=;
         start.now=,start.l=;
         bfs();
         if(!flag)    cout<<-<<endl;
     }
 }