백준 7576번: 토마토 파이썬 코드(bfs)
import sys from collections import deque x = [-1,1,0,0] y = [0,0,-1,1] count = 0 m,n = map(int, sys.stdin.readline().split()) box = [list(map(int,sys.stdin.readline().split()))for _ in range(n)] def bfs(): global count queue = deque([]) for i in range(n): for j in range(m): if box[i][j] == 1: queue.append([i,j,0]) while queue: a,b,c = queue.popleft() for k in range(4): aa = a + x[k] bb = b + y[k..
백준 4963번: 섬의 개수 파이썬 코드(dfs)
import sys one = [-1,1,0,0,1,1,-1,-1] two = [0,0,-1,1,1,-1,1,-1] def dfs(a, b): graph[a][b] = -1 for i in range(8): if 0
