【蓝桥杯】1096. 地牢大师*（三维搜索bfs）

穿越隧道

对输入空行的消失有点不太理解。

#include <iostream>
#include <cstring>
#include <algorithm>
//#defin
using namespace std;

const int N = 110;
struct point{
	int x,y,z;
};
char g[N][N][N];
int dis[N][N][N];
int L,R,C;
point q[N*N*N];//二维扩展
int dx[6] = {-1,1,0,0,0,0};
int dy[6] = {0,0,1,-1,0,0};
int dz[6] = {0,0,0,0,1,-1};
int bfs(point st, point ed){
	memset(dis,-1,sizeof(dis));
	int hh = 0, tt = 0;
	q[0] = st;
	dis[st.x][st.y][st.z] = 0;
	while(hh <= tt){
		point t = q[hh++];
		for(int i = 0; i < 6; i++){
			int x = t.x + dx[i], y = t.y + dy[i], z = t.z + dz[i];
			if(x >= 0 && x < L && y >= 0 && y < R && z >= 0 && z < C && dis[x][y][z] == -1 && (g[x][y][z] == '.' || g[x][y][z] == 'E')){
				dis[x][y][z] = dis[t.x][t.y][t.z] + 1;
				if(x == ed.x && y == ed.y && z == ed.z) return dis[x][y][z];
				q[++tt] = {x,y,z};
			}
		}
	}
	return dis[ed.x][ed.y][ed.z];
} 

int main(){
	while(scanf("%d%d%d",&L,&R,&C), L||R||C){
		point st, ed;
		for(int i = 0; i < L; i++){
			for(int j = 0; j < R; j++){
				scanf("%s",g[i][j]);
				for(int k = 0; k < C; k++){
					char c = g[i][j][k];
					if(c == 'S'){
						st = {i,j,k};
					}
					else if(c == 'E'){                       
						ed = {i,j,k};
					}
				}
			}
		}
		int t = bfs(st,ed);
		if(t == -1) puts("Trapped!");
		else printf("Escaped in %d minute(s).\n",t);
	}
}