백준 - 유기농 배추 - bfs

	import sys
	from collections import deque
	dx = [-1, 1, 0, 0]
	dy = [0, 0, 1, -1]
	def bfs(n, m, xl, yl):
	a = deque()
	a.append((n, m))
	visited[n][m] = True
	while a:
	x, y = a.popleft()
	for i in range(4):
	nx = x + dx[i]
	ny = y + dy[i]
	if 0 <= nx < xl and 0 <= ny < yl:
	if farm[nx][ny] == 1 and not visited[nx][ny]:
	a.append((nx, ny))
	visited[nx][ny] = True
	testCase = int(input())
	for i in range(testCase):
	count = 0
	m, n, k = map(int, sys.stdin.readline().split())
	farm = [[0]*m for _ in range(n)]
	visited = [[False]*m for _ in range(n)]
	for j in range(k):
	x, y = map(int, sys.stdin.readline().split())
	farm[y][x] = 1
	for i in range(n):
	for j in range(m):
	if not visited[i][j] and farm[i][j] == 1:
	bfs(i, j, n, m)
	count += 1
	print(count)

view raw 백준 - 유기농 배추 - bfs hosted with ❤ by GitHub