7569 - 토마토

https://www.acmicpc.net/problem/7569

7569번: 토마토

 

- BFS

 

import sys
input = sys.stdin.readline

from collections import deque

m, n, h = map(int, input().split())
tomato = [[list(map(int, input().split())) for _ in range(n)] for _ in range(h)]

q = deque()
for k in range(h):
    for i in range(n):
        for j in range(m):
            if tomato[k][i][j] == 1:
                q.append([k,i,j])

delta = [(-1,0,0),(1,0,0),(0,-1,0),(0,1,0),(0,0,-1),(0,0,+1)]
predecessor = [[[0] * m for _ in range(n)] for _ in range(h)]

while len(q) != 0:
    w, r, c = q.pop()
    for k, i, j in delta:
        dw = w + k
        dr = r + i
        dc = c + j

        if 0 <= dw < h and 0 <= dr < n and 0 <= dc < m and tomato[dw][dr][dc] == 0:
            tomato[dw][dr][dc] = 1
            q.appendleft([dw,dr,dc])
            predecessor[dw][dr][dc] = predecessor[w][r][c] + 1

for k in range(h):
    for i in range(n):
        for j in range(m):
            if tomato[k][i][j] == 0:
                print(-1)
                exit()

mi = 0
for k in range(h):
    for i in range(n):
        for j in range(m):
            if predecessor[k][i][j] > mi:
                mi = predecessor[k][i][j]

print(mi)

 

저번 문제랑 똑같음 ㅋㅋ; 몇 개만 수정 후 제출