https://www.acmicpc.net/problem/1260 코드const dfs = (visit_num, visited, now, graph) => { if (visit_num == graph.length) { return; } dfs_path.push(now); // 현재 방문 노드 visited[now] = true; for (const nx of graph[now]) { if (!visited[nx]) { dfs(visit_num + 1, visited, nx, graph); } }};const bfs = (n, graph, start) => { let q = [start]; let visited = new Array(n + 1).fill(false);..
문제풀이/DFS_BFS
https://swexpertacademy.com/main/code/problem/problemDetail.do?problemLevel=4&contestProbId=AV14geLqABQCFAYD&categoryId=AV14geLqABQCFAYD&categoryType=CODE&problemTitle=&orderBy=PASS_RATE&selectCodeLang=PYTHON&select-1=4&pageSize=10&pageIndex=1 코드from collections import dequefor _ in range(10): tc, n = map(int, input().split()) arr = list(map(int, input().split())) graph = [[] for _ in r..
https://www.acmicpc.net/problem/6593 코드from collections import dequedx = [1, -1, 0, 0, 0, 0]dy = [0, 0, 1, -1, 0, 0]dz = [0, 0, 0, 0, 1, -1]while True: l, r, c = map(int, input().split()) if l == 0 and r == 0 and c == 0: break q = deque() visited = [[[False]*c for _ in range(r)] for _ in range(l)] dest = [] cube = [[] for _ in range(l)] for i in range(l): for j..
https://www.acmicpc.net/problem/16920 코드처음에 작성한 코드 => 시간 초과from collections import dequeimport sysinput = sys.stdin.readlinen, m, p = map(int, input().split())s = [0]+list(map(int, input().split()))board = [list(input()) for _ in range(n)]ans = [0]*(p+1)dx = [-1, 1, 0, 0]dy = [0, 0, -1, 1]castle = [[] for _ in range(p+1)]# 처음 성의 위치for i in range(n): for j in range(m): if board[i][j] !=..
https://www.acmicpc.net/problem/1743 코드from collections import dequen, m, k = map(int, input().split())trash = [[False]*m for _ in range(n)]for _ in range(k): r, c = map(int, input().split()) trash[r-1][c-1] = Truevisited = [[False]*m for _ in range(n)]def bfs(x, y): res = 1 # 음식물 쓰레기 덩어리의 크기 dx = [-1, 1, 0, 0] dy = [0, 0, -1, 1] q = deque([(x, y)]) visited[x][y] = True w..
