hdu 2102 BFS

原题链接

思路：bfs搜一发

AC代码：

 #include "map"
 #include "queue"
 #include "math.h"
 #include "stdio.h"
 #include "string.h"
 #include "iostream"
 #include "algorithm"
 #define abs(x) x > 0 ? x : -x
 #define max(a,b) a > b ? a : b
 #define min(a,b) a < b ? a : b

 using namespace std;

 int di[][] = {{,,},{,,},{,,-},{,-,},{,,},{-,,}};
 int Map[][][];
 bool vis[][][];
 int t;

 struct Node
 {
     int zz,xx,yy;
     int step;
 };

 void Bfs()
 {
     memset(vis,,sizeof(vis));
     queue<Node>Q;
     Node now,next;
     int l,r;

     now.zz=;
     now.xx=;
     now.yy=;
     now.step=;
     vis[][][] = ;

     Q.push(now);

     while(!Q.empty())
     {
         now = Q.front();
         Q.pop();

         if(Map[now.zz][now.xx][now.yy]==)
         {
             if(now.step<=t)
                 printf("YES\n");
             else
                 printf("NO\n");
             return;
         }
         if(Map[now.zz][now.xx][now.yy]==)
             l=,r=;
         if(Map[now.zz][now.xx][now.yy]==)
             l=,r=;

             for(int i=l; i<r; i++)
             {
                 next.zz = now.zz + di[i][];
                 next.xx = now.xx + di[i][];
                 next.yy = now.yy + di[i][];
                 next.step = now.step + ;
                 if(i==||i==)
                     next.step = now.step;

                 if(Map[next.zz][next.xx][next.yy]!=)
                 {
                     if(!vis[next.zz][next.xx][next.yy])
                     {
                         vis[next.zz][next.xx][next.yy] = ;
                         Q.push(next);
                     }
                 }
             }
     }
     printf("NO\n");
 }

 int main()
 {
     int c,n,m,i,j,k;
     char s;
     scanf("%d",&c);
     while(c--)
     {
         memset(Map,,sizeof(Map));
         scanf("%d%d%d",&n,&m,&t);
         for(i=; i<=; i++)
         {
             for(j=; j<=n; j++)
             {
                 getchar();
                 for(k=; k<=m; k++)
                 {
                     scanf("%c",&s);
                     if(s=='S'||s=='.')
                         Map[i][j][k] = ;
                     if(s=='P')
                         Map[i][j][k] = ;
                     if(s=='#')
                         Map[i][j][k] = ;
                     if(s=='*')
                         Map[i][j][k] = ;
                 }
             }
             getchar();
         }

         Bfs();
     }
     return ;
 }