HDU 2102 拯救公主

    需要注意的是，骑士到达时空传输机就立即回被传输到第二层，除非另一层的相对位置是传输机或墙。

#include <algorithm>
#include <map>
#include <vector>
#include <functional>
#include <string>
#include <cstring>
#include <queue>
#include <set>
#include <cmath>
#include <cstdio>
using namespace std;
#define IOS ios_base::sync_with_stdio(false)
#define TIE std::cin.tie(0)
#define MIN2(a,b) (a<b?a:b)
#define MIN3(a,b) (a<b?(a<c?a:c):(b<c?b:c))
#define MAX2(a,b) (a>b?a:b)
#define MAX3(a,b,c)  (a>b?(a>c?a:c):(b>c?b:c))
typedef long long LL;
typedef unsigned long long ULL;
const int INF = 0x3f3f3f3f;
const double PI = 4.0*atan(1.0);

int c, n, m, t, gx, gy, gz;
typedef struct Piont{
    int z, x, y, t;
    Piont(int z = 0, int x = 0, int y = 0, int t = 0) :z(z), x(x), y(y), t(t){};
}P;

char board[2][15][15];
bool vis[2][15][15];
int dx[4] = { 0, 0, 1, -1 }, dy[4] = { 1, -1, 0, 0 };
bool solve()
{
    memset(vis, 0, sizeof(vis));
    queue<P> que;
    que.push(P());
    vis[0][0][0] = true;
    while (que.size()){
        P p = que.front(); que.pop();
        if (p.t > t) return false;
        if (p.z == gz && p.x == gx && p.y == gy) return true;
        int nx, ny, nz;

        for (int i = 0; i < 4; i++){
            nz = p.z, nx = p.x + dx[i], ny = p.y + dy[i];
            if (0 <= nx && nx < n && 0 <= ny && ny < m
                &&board[nz][nx][ny] != '*'&&!vis[nz][nx][ny]){
                if (board[nz][nx][ny] == '#') nz ^= 1;
                if (board[nz][nx][ny] != '#'&& board[nz][nx][ny]!='*'){
                    que.push(P(nz, nx, ny, p.t + 1));
                    vis[nz][nx][ny] = true;
                }
            }
        }
    }
    return false;
}
int main()
{
    scanf("%d", &c);
    while (c--){
        scanf("%d%d%d", &n, &m, &t);
        for (int i = 0; i < 2; i++){
            for (int j = 0; j < n; j++){
                getchar();
                for (int k = 0; k < m; k++){
                    board[i][j][k] = getchar();
                    if (board[i][j][k] == 'P')
                        gz = i, gx = j, gy = k;
                }
            }
            getchar();
        }
        printf("%s
", solve() ? "YES" : "NO");
    }
}