Link11724번 - 연결 요소의 개수 문제풀이(1) 재귀 구현let input = require("fs").readFileSync("/dev/stdin").toString().trim().split("\n");let idx = 0;const [N, M] = input[idx++].split(" ").map(Number);const graph = Array.from({ length: N + 1 }, () => []);const visited = Array.from({ length: N + 1 }, () => false);let answer = 0;for (let m = 0; m { visited[node] = true; for (let g of graph[node]) { if (visited..

Link1012번 - 유기농 배추 문제풀이(1) DFS 재귀let input = require("fs").readFileSync("/dev/stdin").toString().trim().split("\n");let idx = 0;const T = Number(input[idx++]);const dn = [0, 1, 0, -1];const dm = [1, 0, -1, 0];const answer = Array.from({ length: T }, () => 0);for (let t = 0; t Array.from({ length: M }, () => false) ); const visited = Array.from({ length: N }, () => Array.from({ length: M..

Link11725번 - 트리의 부모 찾기 문제풀이(1)var input = require("fs").readFileSync("/dev/stdin").toString().trim().split("\n");const N = Number(input[0]);let graph = Array.from({ length: N + 1 }, () => []);// 트리의 간선은 N-1개이므로 해당 줄만 처리for (let i = 1; i (2)var input = require("fs").readFileSync("/dev/stdin").toString().trim().split("\n");const N = Number(input[0]);let graph = Array.from({ length: N + 1 }, () => ..