[ BOJ / 파이썬] 1926 그림
/ 제출 1 / from collections import deque #세로, 가로 n, m = map(int, input().split()) board = [list(map(int, input().split())) for _ in range(n)] dx = [1, 0, -1, 0] dy = [0, -1, 0, 1] visited = [[False]*m for _ in range(n)] q = deque([]) def bfs(): cnt = 0 while q: cnt += 1 x, y = q.pop() for i in range(4): nx = x + dx[i] ny = y + dy[i] if 0
