백준 7569. 토마토 문제풀이 자바 JAVA

1BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
2StringTokenizer st = new StringTokenizer(br.readLine(), " ");
3
4M = Integer.parseInt(st.nextToken());
5N = Integer.parseInt(st.nextToken());
6H = Integer.parseInt(st.nextToken());
7
8box = new int[M][N][H];
9
10List<int[]> ripenList = new ArrayList<>();
11
12for (int h = 0; h < H; h++) {
13    for (int n = 0; n < N; n++) {
14        StringTokenizer temp = new StringTokenizer(br.readLine(), " ");
15        for (int m = 0; m < M; m++) {
16            int value = Integer.parseInt(temp.nextToken());
17            if (value == 1) ripenList.add(new int[]{m, n, h});
18            box[m][n][h] = value;
19        }
20    }
21}

1if (value == 1) ripenList.add(new int[]{m, n, h});

1package BOJ;
2
3import java.io.BufferedReader;
4import java.io.IOException;
5import java.io.InputStreamReader;
6import java.util.*;
7
8public class Boj_7569 {
9
10	static int N, M, H;
11	static int[][][] box;
12	static boolean flag = false;
13
14	public static void main(String[] args) throws IOException {
15
16		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
17		StringTokenizer st = new StringTokenizer(br.readLine(), " ");
18
19		M = Integer.parseInt(st.nextToken());
20		N = Integer.parseInt(st.nextToken());
21		H = Integer.parseInt(st.nextToken());
22
23		box = new int[M][N][H];
24
25		List<int[]> ripenList = new ArrayList<>();
26
27		for (int h = 0; h < H; h++) {
28			for (int n = 0; n < N; n++) {
29				StringTokenizer temp = new StringTokenizer(br.readLine(), " ");
30				for (int m = 0; m < M; m++) {
31					int value = Integer.parseInt(temp.nextToken());
32					if (value == 1) ripenList.add(new int[]{m, n, h});
33					box[m][n][h] = value;
34				}
35			}
36		}
37		System.out.println(BFS(ripenList));
38	}
39
40	private static int BFS(List<int[]> list) {
41		if (isFinish()) return 0;
42
43		Queue<int[]> queue = new LinkedList<>();
44		int m; int n; int h;
45
46		// 처음 익은 토마토들을 모두 큐에 넣는다.
47		for (int[] ints : list) {
48			queue.offer(new int[]{ints[0], ints[1], ints[2]});
49		}
50
51		int index = 0;
52
53		while (!queue.isEmpty()) {
54			int len = queue.size();
55			flag = false;
56
57			for (int i = 0; i < len; i++) {
58				int[] poll = queue.poll();
59
60				m = poll[0]; n = poll[1]; h = poll[2];
61
62				validOffer(m + 1, n, h, queue);
63				validOffer(m - 1, n, h, queue);
64				validOffer(m, n + 1, h, queue);
65				validOffer(m, n - 1, h, queue);
66				validOffer(m, n, h + 1, queue);
67				validOffer(m, n, h - 1, queue);
68			}
69			// 아무것도 변경시키지 못한다면
70			if (!flag) {
71				// 안익은 토마토가 있다면 -1 리턴
72				if (!isFinish()) return -1;
73				return index;
74			}
75			index++;
76		}
77		return -1;
78	}
79
80	private static void validOffer(int m, int n, int h, Queue<int[]> queue) {
81		// 조건 통과하면 queue에 삽입
82		if (!(m < 0 || m >= M || n < 0 || n >= N || h < 0 || h >= H)) {
83			if (box[m][n][h] == 0) {
84				flag = true;
85				box[m][n][h] = 1;
86				queue.offer(new int[]{m, n, h});
87			}
88		}
89	}
90
91	private static boolean isFinish() {
92		for (int h = 0; h < H; h++) {
93			for (int n = 0; n < N; n++) {
94				for (int m = 0; m < M; m++) {
95					if (box[m][n][h] == 0) return false;
96				}
97			}
98		}
99		return true;
100	}
101}