Merge pull request #723 from jinoo0306/main

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

Author: github-actions[bot]

live11/test114/문제1/조진우.js

@@ -0,0 +1,54 @@
+const input = require("fs")
+  .readFileSync(
+    process.platform === "linux"
+      ? "/dev/stdin"
+      : require("path").join(__dirname, "input.txt"),
+    "utf8"
+  )
+  .trim();
+
+const LEFT_PAREN = "(";
+const RIGHT_PAREN = ")";
+
+function solution(expr) {
+  const stack = [];
+  const pairs = [];
+
+  for (let i = 0; i < expr.length; i++) {
+    if (expr[i] === LEFT_PAREN) {
+      stack.push(i);
+    } else if (expr[i] === RIGHT_PAREN) {
+      const openIdx = stack.pop();
+      pairs.push([openIdx, i]);
+    }
+  }
+
+  const results = new Set();
+  const total = pairs.length;
+
+  const dfs = (depth, selected) => {
+    if (depth === total) {
+      if (selected.length === 0) return;
+
+      const toRemove = new Set(selected.flat());
+      let str = "";
+      for (let i = 0; i < expr.length; i++) {
+        if (!toRemove.has(i)) {
+          str += expr[i];
+        }
+      }
+      results.add(str);
+      return;
+    }
+
+    dfs(depth + 1, [...selected, pairs[depth]]);
+    dfs(depth + 1, selected);
+  };
+
+  dfs(0, []);
+
+  const sorted = [...results].sort();
+  return sorted.join("\n");
+}
+
+console.log(solution(input));

live11/test114/문제2/조진우.js

@@ -0,0 +1,40 @@
+const input = require("fs")
+  .readFileSync(
+    process.platform === "linux"
+      ? "/dev/stdin"
+      : require("path").join(__dirname, "input.txt"),
+    "utf8"
+  )
+  .trim()
+  .split("\n");
+
+function solution(input) {
+  const N = Number(input[0]);
+  const circles = [];
+
+  for (let i = 1; i <= N; i++) {
+    const [x, r] = input[i].split(" ").map(Number);
+    const id = i;
+    circles.push([x - r, id, 0]);
+    circles.push([x + r, id, 1]);
+  }
+
+  circles.sort((a, b) => a[0] - b[0]);
+
+  const stack = [];
+
+  for (const [_, id, type] of circles) {
+    if (type === 0) {
+      stack.push([id, type]);
+    } else {
+      if (stack.length === 0 || stack[stack.length - 1][0] !== id) {
+        return "NO";
+      }
+      stack.pop();
+    }
+  }
+
+  return "YES";
+}
+
+console.log(solution(input));