백준 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.
백준 2178
처음에 시도한 코드(실패) from collections import deque n, m = map(int, input().split()) map_data = [list(map(int, input())) for m in range(n)] print(map_data) dx = [0, 0, -1, 1] dy = [1, -1, 0, 0] def bfs(x, y): queue = deque() queue.append([x, y]) count = 1 while queue: queue.popleft() for i in range(4): nx = x + dx[i] ny = y + dy[i] if nx m or ny > n: continue if map_data[nx][ny] =..
2023. 4. 5.