校OJ P1139 -- 秦心的面具

一道简单的01迷宫题,直接发代码

#include <iostream>
#include <cstring>
#include <cstdio>
#include <queue>
using namespace std;

const int maxn = 52;
const int dx[6] = {0,0,0,0,1,-1};
const int dy[6] = {0,0,-1,1,0,0};
const int dz[6] = {1,-1,0,0,0,0};
struct Point{
    int x, y, z, s;
    Point( int a, int b, int c, int d ) : x(a), y(b), z(c), s(d) {};
    bool operator < ( const Point a ) const { return s > a.s; }
    bool operator > ( const Point a ) const { return s < a.s; }
};
bool maps[maxn][maxn][maxn], vis[maxn][maxn][maxn], isget;
int sx, sy, sz, tim;
priority_queue<Point> que;

void init() {
    isget = false;
    memset(maps, 0, sizeof(maps));
    memset(vis, 0, sizeof(vis));
    while( !que.empty() ) que.pop();
}

void input() {
    scanf("%d %d %d %d", &sz, &sx, &sy, &tim);
    for( int i