TheWing

from collections import deque n, m = 5, 6 edges = [ [1, 0, 1, 0, 1, 0], [1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 1], [1, 1, 1, 1, 1, 1], [1, 1, 1, 1, 1, 1] ] dx = [-1, 1, 0, 0] dy = [0, 0, -1, 1] def bfs(x, y): queue = deque() queue.append((x, y)) while queue: x, y = queue.popleft() for i in range(4): nx = x + dx[i] my = y + dy[i] if nx = n or my = m: continue if edges[nx][my] =..

n, m = 4, 5 edges = [ [0, 0, 1, 1, 0], [0, 0, 0, 1, 1], [1, 1, 1, 1, 1], [0, 0, 0, 0, 0] ] visited = [[[False] * 5] * 4] def dfs(x, y): if x = n or y = m: return False if edges[x][y] == 0: edges[x][y] = 1 dfs(x - 1, y) dfs(x, y - 1) dfs(x + 1, y) dfs(x, y + 1) return True return False cnt = 0 for i in range(n): for j in range(m): if dfs(i, j): cnt += 1 print(cnt) Reference 해당..

풀이 # 현재 나이트 위치 받기 input_data = input() # 행 row = int((input_data[1]))-1 # 열 column = int(ord(input_data[0])-97) # 이동할 수 있는 8가지 방향 steps = [(-2, -1), (-1, -2), (1, -2), (2, -1), (2, 1), (1, 2), (-1, 2), (-2, 1)] # 결과 cnt = 0 # 반복문으로 검증 후 해당하면 +1 for step in steps: if 0