BOJ 6186 Best Grass

백준 6186 링크

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

6186번: Best Grass

풀이

🙄

코드

from collections import deque
def dajik():
    q=deque([(i,j)])
    while q:
        y,x=q.popleft()
        for k in range(4):
            ny,nx=y+ly[k],x+lx[k]
            if 0<=ny<n and 0<=nx<m and mp[ny][nx]=='#' and visit[ny][nx]==0:
                visit[ny][nx]=1
                q.append((ny,nx))
n,m=map(int,input().split())
mp=[input() for _ in range(n)]
visit=[[0]*m for _ in range(n)]
ly,lx=[0,0,-1,1],[1,-1,0,0]
count=0
for i in range(n):
    for j in range(m):
        if mp[i][j]=='#' and visit[i][j]==0:
            visit[i][j]=1
            dajik()
            count=count+1
print(count)