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] =..

import java.util.*; class Node { int x ; int y ; public Node(int x, int y) { this.x = x; this.y = y; } } public class _2MazeEscape { private static int n = 5; private static int m = 6; private static int[][] 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} }; public static void main(String[] args) { bfs(0, 0); System.out.println(edges[n..

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 해당..

public class _3frozenDrinks { private static int n = 4; private static int m = 5; private static boolean[][] visited = new boolean[n][m]; private final static int[][] edges = { {0, 0, 1, 1, 0}, {0, 0, 0, 1, 1}, {1, 1, 1, 1, 1}, {0, 0, 0, 0, 0} }; private static int cnt = 0; public static void main(String[] args) { for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (dfs(i,j)) { cnt++;..