Merge pull request #690 from jinoo0306/main

[조진우] 105차 라이브 코테 제출

Author: github-actions[bot]

live10/test105/문제1/조진우.js

@@ -0,0 +1,48 @@
+const input = require("fs")
+  .readFileSync(
+    process.platform === "linux"
+      ? "/dev/stdin"
+      : require("path").join(__dirname, "input.txt"),
+    "utf8"
+  )
+  .toString()
+  .trim()
+  .split("\n")
+  .map((line) => line.split(" ").map(Number));
+
+function solution(input) {
+  const [N, M, K, X] = input[0];
+  const graph = Array.from({ length: N + 1 }, () => []);
+  const dist = Array(N + 1).fill(-1);
+
+  for (let i = 1; i <= M; i++) {
+    const [a, b] = input[i];
+    graph[a].push(b);
+  }
+
+  const queue = [X];
+  dist[X] = 0;
+
+  while (queue.length > 0) {
+    const current = queue.shift();
+    for (const next of graph[current]) {
+      if (dist[next] === -1) {
+        dist[next] = dist[current] + 1;
+        queue.push(next);
+      }
+    }
+  }
+
+  const answer = [];
+  for (let i = 1; i <= N; i++) {
+    if (dist[i] === K) answer.push(i);
+  }
+
+  if (answer.length === 0) {
+    return -1;
+  } else {
+    return answer.sort((a, b) => a - b).join("\n");
+  }
+}
+
+console.log(solution(input));

live10/test105/문제2/조진우.js

@@ -0,0 +1,51 @@
+const input = require("fs")
+  .readFileSync(
+    process.platform === "linux"
+      ? "/dev/stdin"
+      : require("path").join(__dirname, "input.txt"),
+    "utf8"
+  )
+  .toString()
+  .trim()
+  .split("\n");
+
+function solution(input) {
+  const n = +input[0];
+  const check = Array.from({ length: 26 }, () => Array(26).fill(false));
+
+  for (let i = 1; i <= n; i++) {
+    const [a, , b] = input[i].split(" ");
+    const x = a.charCodeAt(0) - 97;
+    const y = b.charCodeAt(0) - 97;
+    check[y][x] = true; // ✅ 방향 반대로!
+  }
+
+  for (let k = 0; k < 26; k++) {
+    for (let i = 0; i < 26; i++) {
+      for (let j = 0; j < 26; j++) {
+        if (check[i][k] && check[k][j]) {
+          check[i][j] = true;
+        }
+      }
+    }
+  }
+
+  const m = +input[n + 1];
+  const result = [];
+
+  for (let i = n + 2; i < n + 2 + m; i++) {
+    const [a, , b] = input[i].split(" ");
+    const x = a.charCodeAt(0) - 97;
+    const y = b.charCodeAt(0) - 97;
+
+    if (x === y) {
+      result.push("F");
+    } else {
+      result.push(check[y][x] ? "T" : "F");
+    }
+  }
+
+  return result.join("\n");
+}
+
+console.log(solution(input));

live10/test105/문제3/조진우.js

@@ -0,0 +1,35 @@
+function solution(order) {
+  let box = 1;
+  let count = 0;
+  let tempBox = [];
+  let i = 0;
+
+  while (box <= order.length) {
+    if (order[i] === box) {
+      count++;
+      i++;
+      box++;
+    } else if (tempBox.length > 0 && tempBox[tempBox.length - 1] === order[i]) {
+      tempBox.pop();
+      count++;
+      i++;
+    } else {
+      tempBox.push(box);
+      box++;
+    }
+  }
+
+  while (tempBox.length > 0) {
+    if (tempBox[tempBox.length - 1] === order[i]) {
+      tempBox.pop();
+      count++;
+      i++;
+    } else {
+      break;
+    }
+  }
+
+  return count;
+}
+
+console.log(solution([4, 3, 1, 2, 5]));