99클럽 코테 스터디 12일차 TIL - 백준[7569]

문제 풀이

오늘의 문제 - 백준7569.토마토

나의 풀이

import java.io.*;
import java.util.*;

public class Main {

	static int inputX, inputY, inputZ;
	static int[][][] arr;
	static int[] dx = { 0, 0, -1, 1, 0, 0 }; // 상,하,좌,우, 앞,뒤
	static int[] dy = { 1, -1, 0, 0, 0, 0 };
	static int[] dz = { 0, 0, 0, 0, -1, 1 };
	static Queue<point> qu = new LinkedList<>();

	static class point {
		int x, y, z;

		point(int z, int x, int y) {
			this.x = x;
			this.y = y;
			this.z = z;
		}
	}// class point

	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String[] str = br.readLine().split(" ");
		inputY = Integer.parseInt(str[0]); // 가로
		inputX = Integer.parseInt(str[1]); // 세로
		inputZ = Integer.parseInt(str[2]); // 상자 수

		arr = new int[inputZ][inputX][inputY];

		for (int k = 0; k < inputZ; k++) {
			for (int i = 0; i < inputX; i++) {
				String[] str1 = br.readLine().split(" ");
				for (int j = 0; j < inputY; j++) {
					arr[k][i][j] = Integer.parseInt(str1[j]);
				}
			}
		}

		for (int k = 0; k < inputZ; k++) {
			for (int i = 0; i < inputX; i++) {
				for (int j = 0; j < inputY; j++) {
					if (arr[k][i][j] == 1) {
						qu.add(new point(k, i, j));

					}
				}
			}
		}
		bfs();
		checkTomato();

	}// main()

	static void bfs() {
		while (!qu.isEmpty()) {
			point tmp = qu.poll();
			int tz = tmp.z;
			int tx = tmp.x;
			int ty = tmp.y;

			for (int i = 0; i < 6; i++) {
				int nx = tx + dx[i];
				int ny = ty + dy[i];
				int nz = tz + dz[i];

				if (nx >= 0 && ny >= 0 && nz >= 0 && nx < inputX && ny < inputY && nz < inputZ) {
					if (arr[nz][nx][ny] == 0) {
						qu.add(new point(nz, nx, ny));
						arr[nz][nx][ny] = arr[tz][tx][ty] + 1;
					}
				}

			}

		}
	}// bfs()

	static void checkTomato() {
		int days=0;
		
		for (int k = 0; k < inputZ; k++) {
			for (int i = 0; i < inputX; i++) {
				for (int j = 0; j < inputY; j++) {
					if (arr[k][i][j] == 0) {
						System.out.println(-1);
						return;
					}
					days = Math.max(days, arr[k][i][j]);
				}
			}
		}

		if (days == 1)
			System.out.println(0);
		else {
			System.out.println(days - 1);
		}

	}


}