Baekjoon #14716

Baekjoon #14716

1개의 풀이 · Python

문제 원문 보기 ↗

SOLUTION INFO

Python · main.py

main.py
import sys

def input():
    return sys.stdin.readline().rstrip()

M, N = map(int, input().split())
banner = [list(map(int, input().split())) for _ in range(M)]
dirx = (1, 0, -1, 0, 1, 1, -1, -1)
diry = (0, 1, 0, -1, 1, -1, 1, -1)

def find_string(row, col):
    stack = [(row, col)]
    banner[row][col] = 0
    while stack:
        x, y = stack.pop()
        for dx, dy in zip(dirx, diry):
            nx, ny = x + dx, y + dy
            if 0 <= nx < M and 0 <= ny < N and banner[nx][ny]:
                stack.append((nx, ny))
                banner[nx][ny] = 0
    return 1

string_cnt = 0
for i in range(M):
    for j in range(N):
        if banner[i][j]:
            string_cnt += find_string(i, j)

print(string_cnt)

SOLUTION DESCRIPTION

풀이 설명

등록된 풀이 설명이 없습니다.