백준 알고리즘 1012. 유기농 배추

https://www.acmicpc.net/problem/1012

1012번: 유기농 배추

 

전체 코드

import collections
import sys


def solution(mat):
    def bfs(mat, x, y, width, height):
        queue = collections.deque()
        queue.append((x, y))

        while queue:
            x, y = queue.popleft()
            if 0 <= x < width and 0 <= y < height and mat[y][x] == 1:
                mat[y][x] = 0
                queue.append((x + 1, y))
                queue.append((x - 1, y))
                queue.append((x, y + 1))
                queue.append((x, y - 1))

    width = len(mat[0])
    height = len(mat)
    count = 0
    for y in range(height):
        for x in range(width):
            if mat[y][x] == 1:
                bfs(mat, x, y, width, height)
                count += 1
    return count


t = int(input())
results = []

for _ in range(t):
    m, n, k = map(int, input().split())
    mat = [[0] * m for _ in range(n)]

    for _ in range(k):
        x, y = map(int, sys.stdin.readline().split())
        mat[y][x] = 1

    results.append(solution(mat))

for r in results:
    print(r)