백준 16236
코드 from collections import deque n = int(input()) graph = [] for _ in range(n): graph.append(list(map(int, input().split()))) shark_size = 2 shark_x, shark_y = 0, 0 for i in range(n): for j in range(n): if graph[i][j] == 9: shark_x, shark_y = i, j graph[i][j] = 0 # 상어 위치는 빈칸으로 처리 break dx, dy = [-1, 0, 1, 0], [0, -1, 0, 1] # 북, 서, 남, 동 def bfs(): dist = [[-1] * n for _ in range(n)] q = deque([(s..
2023. 4. 8.