HDU 2102 A计划 bfs

#include <iostream>
#include <vector>
#include <stack>
#include <cstdlib>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <string>
#include <queue>
#include <algorithm>
using namespace std;
#define maxn 15
#define INF 0xfffffff
#define min(a,b) (a<b?a:b)
#define max(a,b) (a>b?a:b)
struct Point
{
    int x, y, z;
    int step;
} Ps, Pe;

char maps[2][maxn][maxn];
bool vis[2][maxn][maxn];
int dir[4][2] = { {1,0}, {-1,0}, {0,1}, {0,-1} };
int m, n, step;
bool OK(Point P)
{
    return P.x >= 0 && P.x < m && P.y >= 0 && P.y < n && maps[P.z][P.x][P.y] != ‘*‘ && !vis[P.z][P.x][P.y];
}
bool BFS()
{
    Point P, Pn;
    queue<Point> Q;
    Q.push(Ps);

    while( !Q.empty() )
    {
        P = Q.front();
        Q.pop();
        if(P.step > step)
            return false;
        if(P.x == Pe.x && P.y == Pe.y && P.z == Pe.z)
            return true;

        for(int i=0; i<4; i++)
        {
            Pn.z = P.z;
            Pn.x = P.x + dir[i][0];
            Pn.y = P.y + dir[i][1];
            Pn.step = P.step + 1;

            if( OK(Pn) )
            {
                vis[Pn.z][Pn.x][Pn.y] = true;
                if(maps[Pn.z][Pn.x][Pn.y] == ‘#‘ && maps[Pn.z^1][Pn.x][Pn.y] == ‘.‘ &&  !vis[Pn.z^1][Pn.x][Pn.y] )
                {
                    Pn.z = Pn.z^1;
                    vis[Pn.z][Pn.x][Pn.y] = true;
                    Q.push(Pn);
                }
                else if(maps[Pn.z][Pn.x][Pn.y] == ‘.‘)
                {
                    Q.push(Pn);
                }
            }
        }
    }
    return false;
}

int main()
{
    int T;
    cin >> T;

    while(T--)
    {
        cin >> m >> n >> step;
        memset(vis,0,sizeof(vis));
        for(int k=0; k<2; k++)
        {
            for(int i=0; i<m; i++)
            {
                cin >> maps[k][i];
                for(int j=0; j<n; j++)
                {
                    if(maps[k][i][j] == ‘S‘)
                        Ps.x = i, Ps.y = j, Ps.z = k, Ps.step = 0, maps[k][i][j] = ‘.‘;
                    if(maps[k][i][j] == ‘P‘)
                        Pe.x = i, Pe.y = j, Pe.z = k, maps[k][i][j] = ‘.‘;
                }
            }
        }

        if( BFS() )
            cout << "YES" <<endl;
        else
            cout << "NO" << endl;
    }
    return 0;
}