dfs 코드 import sys sys.setrecursionlimit(10**7) input = sys.stdin.readline column, row, trash = map(int, input().split()) zido = [[0] * row for _ in range(column)] dx, dy = [1,-1,0,0], [0,0,1,-1] for _ in range(trash): x,y = map(int, input().split()) zido[x-1][y-1] = 1 # 쓰레기를 구분할 수 있도록 1로 변경 def dfs(x,y): global count for i in range(4): nx=x+dx[i] ny=y+dy[i] if 0
