hdu1240 bfs 水题

原题链接

思路：水题，直接搜

#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 z2,x2,y2,n;
int d[6][3]= {{0,0,1},{0,1,0},{0,0,-1},{0,-1,0},{1,0,0},{-1,0,0}};
bool Map[15][15][15],vis[15][15][15];

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

void Bfs(int z,int x,int y)
{
    memset(vis,0,sizeof(vis));
    queue<Node>Q;
    Node now,next;

    now.zz = z;
    now.xx = x;
    now.yy = y;
    now.step = 0;
    vis[z][x][y] = 1;

    Q.push(now);

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

        if(now.zz==z2 && now.xx==x2 && now.yy==y2)
        {
            printf("%d %d
",n,now.step);
            return;
        }

        for(int i=0; i<6; i++)
        {
            next.zz = now.zz + d[i][0];
            next.xx = now.xx + d[i][1];
            next.yy = now.yy + d[i][2];
            next.step = now.step + 1;

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

int main()
{
    int x1,y1,z1,i,j,k;
    char s[20],c;
    while(~scanf("%s%d",s,&n))
    {
        memset(Map,0,sizeof(Map));
        for(i=1; i<=n; i++)
            for(j=1; j<=n; j++)
            {
                getchar();
                for(k=1; k<=n; k++)
                {
                    scanf("%c",&c);
                    if(c=='O')
                        Map[i][j][k] = 1;
                    if(c=='X')
                        Map[i][j][k] = 0;
                }
            }

        scanf("%d%d%d%d%d%d",&x1,&y1,&z1,&x2,&y2,&z2);
        z1+=1,x1+=1,y1+=1,z2+=1,x2+=1,y2+=1;
        getchar();
        gets(s);

        Bfs(z1,x1,y1);
    }
    return 0;
}