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

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

1012번: 유기농 배추

from collections import deque

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

def bfs(x, y, cnt):
    q.append([x, y])
    c[x][y] = cnt
    while q:
        x, y = q.popleft()
        for i in range(4):
            nx = x + dx[i]
            ny = y + dy[i]
            if 0 <= nx < n and 0 <= ny < m:
                if a[nx][ny] == 1 and c[nx][ny] == 0:
                    q.append([nx, ny])
                    c[nx][ny] = cnt

tc = int(input())
while tc > 0:
    m, n, k = map(int, input().split())
    a = [[0]*m for _ in range(n)]
    c = [[0]*m for _ in range(n)]
    q = deque()
    for _ in range(k):
        x, y = map(int, input().split())
        a[y][x] = 1
    cnt = 1
    for i in range(n):
        for j in range(m):
            if a[i][j] == 1 and c[i][j] == 0:
                bfs(i, j, cnt)
                cnt += 1
    print(cnt-1)
    tc -= 1