hduoj 2102 a计划

bfs

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<queue>
#include<cmath>
using namespace std;
typedef struct
{
    int x;
    int y;
    int z;
    int step;
} node;
char Map[12][12][2];
bool visit[12][12][2];
int dx[4]= {1,0,-1,0};
int dy[4]= {0,1,0,-1};
int n,m,t;
bool check(int x,int y,int z)
{
    if(x<0||y<0||x>=n||y>=m||Map[x][y][z]=='*')
        return 1;
    else
        return 0;
}
int start[3];
void bfs()
{
    memset(visit,false,sizeof(visit));
    queue<node> Q;
    node a;
    a.x=start[0];
    a.y=start[1];
    a.z=start[2];
    a.step=0;
    visit[a.x][a.y][a.z]=true;
    Q.push(a);
    //cout<<a.x<<" "<<a.y<<" "<<a.z<<" "<<a.step<<" "<<endl;
    while(!Q.empty())
    {
        node b;
        b=Q.front();
        Q.pop();
        for(int i=0; i<4; i++)
        {
            node c=b;
            c.x+=dx[i];
            c.y+=dy[i];
            c.step++;
            if(c.step>t)
                break;
            if(check(c.x,c.y,c.z)||visit[c.x][c.y][c.z])
                continue;
            visit[c.x][c.y][c.z]=true;
            if(Map[c.x][c.y][c.z]=='#')
            {
                c.z=!c.z;
                if(check(c.x,c.y,c.z)||visit[c.x][c.y][c.z]||Map[c.x][c.y][c.z]=='#')
                    continue;
                visit[c.x][c.y][c.z]=true;
            }
            if(Map[c.x][c.y][c.z]=='P')
            {
                cout<<"YES"<<endl;
                return ;
            }
            Q.push(c);
            //cout<<c.x<<" "<<c.y<<" "<<c.z<<" "<<c.step<<" "<<endl;
        }
    }
    cout<<"NO"<<endl;
};
int main()
{
    int T;
    cin>>T;
    while(T--)
    {
        cin>>n>>m>>t;
        for(int o=0; o<2; o++)
        {
            for(int p=0; p<n; p++)
            {
                for(int q=0; q<m; q++)
                {
                    cin>>Map[p][q][o];
                    if(Map[p][q][o]=='S')
                    {
                        start[0]=p;
                        start[1]=q;
                        start[2]=o;
                    }
                }
            }

        }

        bfs();
    }
    return 0;
}