[백준] 1012번 유기농 배추 (파이썬)

1012번: 유기농 배추

 

 

코드

import sys
sys.setrecursionlimit(10**6)

T = int(input())

def start():
    m, n, k = map(int, input().split())
    tree = list([0 for _ in range(m)] for _ in range(n))
    answer = []

    for _ in range(k):
        x, y = map(int, input().split())
        tree[y][x] = 1

    dx = [1,-1,0,0]
    dy = [0,0,1,-1]

    def dfs(tree, cnt, x, y):
        tree[x][y] = 0
        for i in range(4):
            n_x = x + dx[i]
            n_y = y + dy[i]
            if 0 <= n_x < n and 0 <= n_y < m:
                if tree[n_x][n_y] == 1:
                    cnt = dfs(tree, cnt+1, n_x, n_y)
        return cnt

    for i in range(n):
        for j in range(m):
            if tree[i][j] == 1:
                answer.append(dfs(tree,1,i,j))

    print(len(answer))

for _ in range(T):
    start()