A - 王之迷宫

Time Limit: 20 Sec  Memory Limit: 256 MB

题目连接

http://acm.uestc.edu.cn/#/contest/show/61

Description

王被困在了一个3维的迷宫中，他很想逃离这个迷宫回去当学霸，你能帮助他么? 由于王很仁慈，他悄悄地告诉你，本题读入迷宫的每一行时，要用scanf("%s"...) ......

Input

#####
#####
##.##
##...

#####
#####
#.###
####E

1 3 3
S##
#E#
###

0 0 0

//qscqesze

#include <cstdio>

#include <cmath>

#include <cstring>

#include <ctime>

#include <iostream>

#include <algorithm>

#include <set>

#include <vector>

#include <sstream>

#include <queue>

#include <typeinfo>

#include <fstream>

#include <map>

#include <stack>

typedef long long ll;

using namespace std;

//freopen("D.in","r",stdin);

//freopen("D.out","w",stdout);

#define sspeed ios_base::sync_with_stdio(0);cin.tie(0)

#define maxn 200001

#define mod 10007

#define eps 1e-9

int Num;

char CH[];

//const int inf=0x7fffffff;   //нчоч╢С

const int inf=0x3f3f3f3f;

/*

inline void P(int x)

{

    Num=0;if(!x){putchar('0');puts("");return;}

    while(x>0)CH[++Num]=x%10,x/=10;

    while(Num)putchar(CH[Num--]+48);

    puts("");

}

*/

//**************************************************************************************

inline ll read()

{

    int x=,f=;char ch=getchar();

    while(ch<''||ch>''){if(ch=='-')f=-;ch=getchar();}

    while(ch>=''&&ch<=''){x=x*+ch-'';ch=getchar();}

    return x*f;

}

inline void P(int x)

{

    Num=;if(!x){putchar('');puts("");return;}

    while(x>)CH[++Num]=x%,x/=;

    while(Num)putchar(CH[Num--]+);

    puts("");

}

string s[][];

int vis[][][];

int dx[]={,,,-,,};

int dy[]={,-,,,,};

int dz[]={,,,,,-};

struct node

{

    int x,y,z;

    ll t;

};

int l,r,c;

int main()

{

    while(scanf("%d%d%d",&l,&r,&c)!=EOF)

    {

        memset(vis,,sizeof(vis));

        if(l==&&r==&&c==)

            break;

        node st,ed;

        for(int i=;i<l;i++)

            for(int j=;j<r;j++)

                cin>>s[i][j];

        for(int i=;i<l;i++)

        {

            for(int j=;j<r;j++)

            {

                for(int k=;k<c;k++)

                {

                    if(s[i][j][k]=='S')

                    {

                        st.x=i,st.y=j,st.z=k,st.t=;

                        vis[st.x][st.y][st.z]=;

                    }

                }

            }

        }

        int time=-;

        queue<node> q;

        q.push(st);

        while(!q.empty())

        {

            node now=q.front();

            q.pop();

            if(s[now.x][now.y][now.z]=='E')

            {

                time=now.t;

                break;

            }

            for(int i=;i<;i++)

            {

                node next=now;

                next.x+=dx[i];

                next.y+=dy[i];

                next.z+=dz[i];

                next.t++;

                if(next.x<||next.x>=l)

                    continue;

                if(next.y<||next.y>=r)

                    continue;

                if(next.z<||next.z>=c)

                    continue;

                if(s[next.x][next.y][next.z]=='#')

                    continue;

                if(vis[next.x][next.y][next.z])

                    continue;

                vis[next.x][next.y][next.z]=;

                q.push(next);

            }

        }

        if(time==-)

            printf("Trapped!\n");

        else

            printf("Escaped in %d minute(s).\n",time);

    }

}