글 읽기 - 런타임 에러가 왜 나는지 모르겠어요?

ih0070 5년 전 0

도대체 무엇떄문에 런타임 에러가 발생하나요? 메모리 초과는 잡은거 같은대...

package bakjun;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.LinkedList;
import java.util.Queue;
import java.util.StringTokenizer;

public class Main {
	static int L, R, C, cnt;
	static int x,y,z;
	static char map[][][];
	static boolean visited[][][], flag;
	static Queue<Node> q = new LinkedList<>();

	static int dx[] = { 1, -1, 0, 0, 0, 0 };
	static int dy[] = { 0, 0, 1, -1, 0, 0 };
	static int dz[] = { 0, 0, 0, 0, 1, -1 };

	public static class Node {
		int x, y, z;
		int dist;

		public Node(int _z, int _x, int _y, int _dist) {
			this.x = _x;
			this.y = _y;
			this.z = _z;
			this.dist = _dist;
		}
	}

	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		
		while(true){
	    StringTokenizer st = new StringTokenizer(br.readLine().trim());
		L = Integer.parseInt(st.nextToken());
		R = Integer.parseInt(st.nextToken());
		C = Integer.parseInt(st.nextToken());
		
		if(L == 0 && R == 0 && C == 0)
			break;
		
		map = new char[L+2][R+2][C+2];
		visited = new boolean[L+2][R+2][C+2];
		cnt =0;
		flag = false;
		
		for(int i =0; i<L ; i++) {
			for(int j =0; j<R; j++) {
				String str = br.readLine();
				for(int k =0; k<C; k++) {
					map[i][j][k] = str.charAt(k);  
					if(map[i][j][k] == 'S') {
						z =i;
						x =j;
						y =k;
					}
				}
			}
			br.readLine();
		}

		bfs(z,x,y);
		
		if(flag) {
			System.out.println("Escaped in "+cnt+" "+"minute(s).");
		}
		else {
			System.out.println("Trapped!");
		}
	}
}

	public static void bfs(int z, int x, int y) {
		int qsize = q.size();
		q.add(new Node(z,x,y,1));

		while (!q.isEmpty()) {
			Node temp = q.poll();

			visited[temp.z][temp.x][temp.y] = true;

			for (int i = 0; i < 6; i++) {
				int x1 = temp.x + dx[i];
				int y1 = temp.y + dy[i];
				int z1 = temp.z + dz[i];

				if (x1 < 0 || x1 >= R || y1 < 0 || y1 >= C || z1 < 0 || z1 >= L)
					continue;

				if (visited[z1][x1][y1] || map[z1][x1][y1] == '#')
					continue;
				
				if (map[z1][x1][y1] == 'E') {
					cnt = temp.dist;
					flag = true;
					q.remove();
				}
				q.add(new Node(z1, x1, y1, temp.dist + 1));
			}
		}
	}
}