백준 4963번: 섬의 개수

4963번: 섬의 개수 (acmicpc.net)

4963번: 섬의 개수

 

from collections import deque
graph = []
dx = [-1,1,0,0,-1,1,-1,1]
dy = [0,0,-1,1,1,-1,-1,1]
def apt(y,x):
    que = deque()
    que.append((x,y))
    if graph[x][y]== 0:
        return False
    while que:
        x,y = que.popleft()
        for i in range(8):
            nx = x + dx[i]
            ny = y + dy[i]
            if nx<0 or ny<0 or nx>=m or ny>=n:
                continue
            if graph[nx][ny]==0:
                continue
            if graph[nx][ny]==1:
                    que.append((nx,ny))
                    graph[x][y]=0
                    graph[nx][ny]=0
    return True
while True:
    n, m = map(int, input().split())
    count = 0
    graph = []
    if n==0 and m==0:
        exit(0)
    for _ in range(m):
        graph.append(list(map(int,input().split())))
    for h in range(m):
        for w in range(n):
            result=apt(w,h)
            if result == True:
                count += 1
    print(count)