[백준] 4963번:섬의 개수 (python 파이썬)

문제

www.acmicpc.net/problem/4963

4963번: 섬의 개수

 

소스코드

from collections import deque
import sys
sys.setrecursionlimit(100000)
input = sys.stdin.readline

def dfs(x, y):
    dx = [-1, 0, 1, -1, 0, 1, -1, 0, 1]
    dy = [-1, -1, -1, 0, 0, 0, 1, 1, 1]
    arr[y][x]=0
    for i in range(9):
        nowx, nowy = dx[i]+x, dy[i]+y
        if 0<=nowx<w and 0<=nowy<h and arr[nowy][nowx]:
            dfs(nowx, nowy)


while True:
    w, h = map(int, input().split())
    if w==0 and h==0:
        break
    arr = [list(map(int,input().split())) for _ in range(h)]
    cnt = 0
    for i in range(h):
        for j in range(w):
            if arr[i][j]==1:
                cnt += 1
                dfs(j, i)
    print(cnt)