https://school.programmers.co.kr/learn/courses/30/lessons/1844?language=javascript코드function solution(maps) { const n = maps.length; const m = maps[0].length; const dx = [0, 0, -1, 1]; const dy = [-1, 1, 0, 0]; const visited = Array.from(new Array(n), () => new Array(m).fill(false)); visited[0][0] = true; const q = []; q.push({ x: 0, y: 0, cnt: 1 }); while (q.length > 0) { const { x,..
문제풀이/DFS_BFS
https://www.acmicpc.net/problem/1039코드from collections import deque, defaultdictn, k = input().split()n_len = len(n)k = int(k)q = deque([(n, 0)])visited = defaultdict(set)visited[n].add(0)answer = -1while q: now, cnt = q.popleft() if cnt == k: answer = max(int(now), answer) continue for i in range(n_len-1): for j in range(i+1, n_len): if (i == 0 and now[j..
https://www.acmicpc.net/problem/22868코드from collections import dequeimport sysinput = sys.stdin.readlinen, m = map(int, input().split())graph = [[] for _ in range(n+1)]for _ in range(m): a, b = map(int, input().split()) graph[a].append(b) graph[b].append(a)for i in range(1, n+1): graph[i].sort()s, e = map(int, input().split())def bfs(excludes): q = deque([[s]]) visited = [False..
https://www.acmicpc.net/problem/15558 코드from collections import dequen, k = map(int, input().split())game_map = []for _ in range(2): game_map.append("0"+input())q = deque([(0, 1, 1)])visited = [[False]*(n+1) for _ in range(2)]visited[0][1] = Truewhile q: line, num, sec = q.popleft() for nx_line, nx_num in [(line, num+1), (line, num-1), (line ^ 1, num+k)]: if nx_num > n: ..
https://www.acmicpc.net/problem/2665코드from collections import dequen = int(input())rooms = [input() for _ in range(n)]dx = [-1, 1, 0, 0]dy = [0, 0, -1, 1]q = deque([(0, 0)])visited = [[int(1e9)]*n for _ in range(n)]visited[0][0] = 0while q: x, y = q.popleft() for i in range(4): nx = x+dx[i] ny = y+dy[i] if 0 visited[x][y]+1: visited[nx][ny] = visited[x]..
