[백준 문제풀이] 얼렁뚱땅 7576 토마토 풀이

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

7576번: 토마토

 

from collections import deque
import sys

n, m = map(int,input().split())
arr = [list(map(int,input().split())) for i in range(m)]

q = deque()

for i in range(m) :
    for j in range(n) :
        if arr[i][j] == 1 :
            q.append([i,j,0])

dx = [0, 0, 1, -1]
dy = [1, -1, 0, 0]
temp_time = -1
while q : 
    x, y, time = q.popleft()
    for i in range(len(dx)):
        nx = x + dx[i]
        ny = y + dy[i]
        if 0<=nx<m and 0<=ny<n :
            if arr[nx][ny] == 0 :
                arr[nx][ny] = 1
                q.append([nx,ny,time+1])

for i in range(m) :
    cnt=arr[i].count(0)
    if cnt > 0 :
        print(-1)
        sys.exit()

print(time)

기분 좋은뎁쇼