기록하는 습관

문제 www.acmicpc.net/problem/2178 코드 from collections import deque n, m = map(int, input().split()) graph = [] for _ in range(n): graph.append(list(map(int, input()))) dx = [-1, 1, 0, 0] # 상, 하, 좌, 우 dy = [0, 0, -1, 1] def bfs(x,y): q = deque() q.append((x,y)) while q: x,y = q.popleft() for i in range(4): nx = x + dx[i] ny = y + dy[i] if nx = n or ny >= m: # 가장자리 벽 pass contin..