이것저것 기록 블로그

from collections import deque from itertools import combinations import copy n, m = map(int, input().split()) graph = [] two = [] answer = 0 for _ in range(n): graph.append(list(map(int, input().split()))) dx = [-1, 1, 0, 0] dy = [0, 0, -1, 1] def bfs(): two = deque() graph_ = copy.deepcopy(graph) for i in range(n): for j in range(m): if graph_[i][j] == 2: two.append([i,j]) while two: y, x = two..

import sys input = sys.stdin.readline n, m = map(int, input().split()) graph = [] visited = [[0 for _ in range(m)] for _ in range(n)] dx = [-1, 1, 0, 0] dy = [0, 0, -1, 1] for _ in range(n): graph.append(list(map(int, input().split()))) def dfs(y, x, count): if visited[y][x] == 0: visited[y][x] = 1 if graph[y][x] != 0: graph[y][x] = count for i in range(4): nx = x + dx[i] ny = y + dy[i] if 0