hdu 2102 广度搜索

#include<iostream>
#include<queue>
using namespace std;
int n,m,T,zd,xd,yd,vist[2][11][11],flag;
char map[2][11][11];
int dir[4][2]={1,0,0,1,-1,0,0,-1};
struct node
{
 int x;
 int y;
 int z;
 int time;
};
void bfs()
{
 queue<node> s;
 node a,b;
 a.z=0;
 a.x=0;
 a.y=0;
 a.time=0;
 s.push(a);
 while(!s.empty())
 {
  b=s.front();//cout<<b.z<<' '<<b.x<<' '<<b.y<<endl;
  if(b.z==zd && b.x==xd && b.y==yd && b.time<=T)
  {cout<<b.time<<' '<<endl;
   flag=1;
   return ;
  }
  s.pop();
  for(int i=0;i<4;i++)
  {
   a.x=b.x+dir[i][0];
   a.y=b.y+dir[i][1];
   a.z=b.z;
   if(a.x>=0 && a.x<n && a.y>=0 && a.y<m && map[a.z][a.x][a.y]!='*' && vist[a.z][a.x][a.y]==0)
   {
    vist[a.z][a.x][a.y]=1;
    if(map[a.z][a.x][a.y]=='#')
    {
     if(a.z==0)
     {
                        a.z=1;
     }
     else
     {
      a.z=0;
     }
     if(map[a.z][a.x][a.y]!='*' && map[a.z][a.x][a.y]!='#' && vist[a.z][a.x][a.y]==0)
     {
      a.time=b.time+1;
      if(a.time<=T)
      {
       s.push(a);
           vist[a.z][a.x][a.y]=1;
      }
     }
    }
    else
    {
      a.time=b.time+1;
      if(a.time<=T)
      {
        s.push(a);
      }
    }
   }
  }
 }
}
int main()
{
 int i,j,k,s;
 freopen("E:\\test.txt","r",stdin);
    cin>>s;
 while(s--)
 {
  cin>>n>>m>>T;
  for(k=0;k<=1;k++)
  {
   for(i=0;i<n;i++)
   {
    for(j=0;j<m;j++)
    {
     cin>>map[k][i][j];
     if(map[k][i][j]=='P')
     {
      zd=k;
      xd=i;
      yd=j;
     }
    }
   }
  }
  flag=0;
  memset(vist,0,sizeof(vist));
  vist[0][0][0]=1;
     bfs();
  if(flag==1)
  {
   cout<<"YES"<<endl;
  }
  else
  {
   cout<<"NO"<<endl;
  }
 }
 return 0;
}