HDU_1240_Asteroids!

HDU 1240

题意：给定初始位置的坐标和目标坐标，求从起点移动到终点的最小步数，这里是三维坐标，故需要开三维数组，输入时每个n*n是指空间n*n*n沿水平（即x轴）的纵向截面各个点的情况。
思路：求最短路，不加权，直接BFS即可。

#include <iostream>
#include <iomanip>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <set>
#include <map>
#include <list>
#include <stack>
#include <deque>
#include <queue>
#include <vector>
#include <algorithm>
#include <functional>

#define debug(x) cout << "--------------> " << x << endl

using namespace std;

const double PI = acos(-1.0);
const double eps = 1e-10;
const long long INF = 0x7fffff;
const long long MOD = 1000000007;
const int MAXN = 10 + 7;
char gra[MAXN][MAXN][MAXN];
bool vis[MAXN][MAXN][MAXN];
int dep[MAXN][MAXN][MAXN];
int n;
int dx[] = { 1, -1, 0, 0, 0, 0 };
int dy[] = { 0, 0, 1, -1, 0, 0 };
int dz[] = { 0, 0, 0, 0, 1, -1 };
int initial_X, initial_Y, initial_Z, target_X, target_Y, target_Z;
class Point
{
public:
    Point(int a, int b, int c) : x(a), y(b), z(c){};
    int x, y, z;
};

bool isValidRoad(int x, int y, int z)
{
    return x < n && x >= 0 && y < n && y >= 0 && z < n && z >= 0 && !vis[x][y][z];
}

void BFS(int x, int y, int z)
{
    memset(dep, 0, sizeof(dep));
    memset(vis, false, sizeof(vis));
    vis[x][y][z] = true;
    Point p(x, y, z);
    queue<Point> q;
    q.push(p);
    while(!q.empty())
    {
        Point P = q.front();
        q.pop();
        for(int i = 0; i < 6; ++i)
        {
            Point PP(P.x + dx[i], P.y + dy[i], P.z + dz[i]);
            if(isValidRoad(PP.x, PP.y, PP.z))
            {
                vis[PP.x][PP.y][PP.z] = true;
                dep[PP.x][PP.y][PP.z] = dep[P.x][P.y][P.z] + 1;
                if(gra[PP.x][PP.y][PP.z] == 'X')continue;
                q.push(PP);
            }

        }
    }
    return;
}

int main()
{
    string flag;
    while (cin >> flag)
    {
        if(flag == "START")
        {
            scanf("%d", &n);
            for(int i = 0; i < n; ++i)
            {
                for(int j = 0; j < n; ++j)
                {
                   scanf("%s", gra[i][j]);
                }
            }
            scanf("%d%d%d%d%d%d", &initial_X, &initial_Y, &initial_Z, &target_X, &target_Y, &target_Z);
            BFS(initial_X, initial_Y, initial_Z);
        }
        else
        {
            if(initial_X == target_X && initial_Y == target_Y && initial_Z == target_Z)
                printf("%d 0\n", n);
            else
                dep[target_X][target_Y][target_Z] == 0 ? printf("NO ROUTE\n") : printf("%d %d\n", n, dep[target_X][target_Y][target_Z]);
        }

    }
    return 0;
}