[백준][Python] 1743번 음식물 피하기

1743번: 음식물 피하기

 

 

코드

from collections import deque
def bfs(x,y):
	global cnt
	queue = deque()
	queue.append((x,y))
	while queue:
		x,y = queue.popleft()
		for i in range(4):
			nx = x+dx[i]
			ny = y+dy[i]
			if 1<=nx<=n and 1<=ny<=m and graph[nx][ny] == 1:
				graph[nx][ny] = 0
				cnt += 1
				queue.append((nx,ny))

	

n,m,k = map(int,input().split())
graph = [[0]*(m+1) for _ in range(n+1)]

for _ in range(k):
	r,c = map(int,input().split())
	graph[r][c] = 1
dx = [1,-1,0,0]
dy = [0,0,1,-1]
ans = 0
for i in range(1,n+1):
	for j in range(1,m+1):
		if graph[i][j] == 1:
			cnt = 0
			bfs(i,j)
			ans = max(ans,cnt)
print(ans)