BOJ 1926 그림

백준 1926 링크

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

1926번: 그림

풀이

🙄

코드

from collections import deque
input=__import__('sys').stdin.readline
n,m = map(int, input().split())
mp = [list(map(int, input().split())) for _ in range(n)]
cnt=0
mx=0
ly,lx=[0,0,1,-1],[1,-1,0,0]
for i in range(n):
    for j in range(m):
        if mp[i][j]==1:
            temp=0
            cnt=cnt+1
            q=deque([(i,j)])
            mp[i][j]=0
            while q:
                y,x=q.popleft()
                temp+=1
                for j in range(4):
                    ny=y+ly[j];nx=x+lx[j]
                    if 0<=ny<n and 0<=nx<m and mp[ny][nx]==1:
                        q.append((ny,nx))
                        mp[ny][nx]=0
            mx=max(mx,temp)
print(cnt)
print(mx)