Part6.8_완전탐색_깊이,넓이 우선탐색활용_사과나무(BFS)

선생님 코드

이런식으로 사과 격자 탐색

import sys
sys.stdin = open("input.txt", "rt")
from collections import deque

dx = [-1, 0, 1, 0]
dy = [0, 1, 0, -1]
n= int(input())
a=[list(map(int, input().split())) for _ in range(n)]
ch = [[0]*n for _ in range(n)]
sum = 0
Q = deque()

ch[n//2][n//2] = 1
sum += a[n//2][n//2]
Q.append((n//2, n//2))
L = 0
while True:
    if L == n//2:
        break
    size = len(Q)
    for i in range(size):
        tmp = Q.popleft()
        for j in range(4):
            x = tmp[0]+dx[j]
            y = tmp[1]+dy[j]
            if ch[x][y] == 0:
                sum += a[x][y]
                ch[x][y] = 1
                Q.append((x, y))
    L+=1
print(sum)