BFS基础 地牢大师

#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
const int N = 110;

struct Point
{
	int x, y, z;
}; 

Point q[N * N * N]; //用于宽搜的队列
int l, r, c; //用于表示层数，行数和列数
int dist[N][N][N]; //用于记录是否搜过了
char g[N][N][N]; //用于存储输入
Point s, e;

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 s, Point e)
{
	int hh = 0, tt = 0;
	q[0] = s;
	memset(dist, -1, sizeof dist);
	dist[s.x][s.y][s.z] = 0;

	while (hh <= tt) //当队列不为空时
	{
		auto t = q[hh++];  //取出队头元素
		
		/*将6个相邻的元素放入队尾*/
		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)
				continue;  //出界了
			if (g[x][y][z] == '#') continue; //有障碍物   
			
			if (dist[x][y][z] != -1) continue; //之前走过

			dist[x][y][z] = dist[t.x][t.y][t.z] + 1;
			
			if (x == e.x && y == e.y && z == e.z) return dist[x][y][z];

			q[++tt] = { x,y,z }; //将这个点入队
		}
	}
	return -1;

}

int main()
{
	cin >> l >> r >> c;
	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 ca = g[i][j][k];


				if (ca == 'E')
					e = { i,j,k };
			
				else if (ca == 'S')
					s = { i,j,k };
			}
		}
	
	cout << s.x<< s.y << s.z << endl;
	cout << e.x << e.y << e.z << endl;
	
	int min = bfs(s, e);

	cout << min<<endl;
	return 0;
}