Merge pull request #702 from eric-hjh/main

[황장현] 107차 라이브 코테 제출

Author: eric-hjh

.github/workflows/merge-and-generate-problems.yml

@@ -85,10 +85,9 @@ jobs:
       - name: Create Next Test Folder
         if: env.pr_found == 'true'
         run: |
-          mkdir -p $LIVE_FOLDER/$NEXT_TEST/{문제1,문제2,문제3}
+          mkdir -p $LIVE_FOLDER/$NEXT_TEST/{문제1,문제2}
           touch $LIVE_FOLDER/$NEXT_TEST/문제1/.gitkeep
           touch $LIVE_FOLDER/$NEXT_TEST/문제2/.gitkeep
-          touch $LIVE_FOLDER/$NEXT_TEST/문제3/.gitkeep
           echo "✅ Created folder: $LIVE_FOLDER/$NEXT_TEST"
 
       - name: Commit and Push Changes

live10/test107/문제1/황장현.js

@@ -0,0 +1,94 @@
+class MinHeap {
+  constructor() {
+    this.heap = [];
+  }
+
+  push(node) {
+    this.heap.push(node);
+    this.bubbleUp();
+  }
+
+  pop() {
+    if (this.heap.length === 1) return this.heap.pop();
+    const min = this.heap[0];
+    this.heap[0] = this.heap.pop();
+    this.bubbleDown();
+    return min;
+  }
+
+  bubbleUp() {
+    let i = this.heap.length - 1;
+    while (i > 0) {
+      const parent = Math.floor((i - 1) / 2);
+      if (this.heap[parent][0] <= this.heap[i][0]) break;
+      [this.heap[parent], this.heap[i]] = [this.heap[i], this.heap[parent]];
+      i = parent;
+    }
+  }
+
+  bubbleDown() {
+    let i = 0;
+    const len = this.heap.length;
+    while (true) {
+      const left = 2 * i + 1;
+      const right = 2 * i + 2;
+      let smallest = i;
+
+      if (left < len && this.heap[left][0] < this.heap[smallest][0])
+        smallest = left;
+      if (right < len && this.heap[right][0] < this.heap[smallest][0])
+        smallest = right;
+      if (smallest === i) break;
+
+      [this.heap[i], this.heap[smallest]] = [this.heap[smallest], this.heap[i]];
+      i = smallest;
+    }
+  }
+
+  size() {
+    return this.heap.length;
+  }
+}
+
+const input = require('fs')
+  .readFileSync(process.platform === 'linux' ? '/dev/stdin' : './input.txt')
+  .toString()
+  .trim()
+  .split('\n')
+  .map((el) => el.split(' ').map(Number));
+
+function solution(input) {
+  const [V, E] = input[0];
+  const K = input[1][0];
+  const edges = input.slice(2);
+
+  const graph = Array.from({ length: V + 1 }, () => []);
+  for (const [u, v, w] of edges) {
+    graph[u].push([v, w]);
+  }
+
+  const ans = Array(V + 1).fill(Infinity);
+  ans[K] = 0;
+
+  const minHeap = new MinHeap();
+  minHeap.push([0, K]);
+
+  while (minHeap.size()) {
+    const [dis, node] = minHeap.pop();
+    if (dis > ans[node]) continue;
+
+    for (const [v, w] of graph[node]) {
+      if (ans[v] > dis + w) {
+        ans[v] = dis + w;
+        minHeap.push([ans[v], v]);
+      }
+    }
+  }
+
+  return ans
+    .slice(1)
+    .map((x) => (x === Infinity ? 'INF' : x))
+    .join('\n');
+}
+
+console.log(solution(input));

live10/test107/문제2/황장현.js

@@ -0,0 +1,34 @@
+const input = require('fs')
+  .readFileSync(process.platform === 'linux' ? '/dev/stdin' : './input.txt')
+  .toString()
+  .trim()
+  .split('\n')
+  .map((el) => el.split(' ').map(Number));
+
+function solution(input) {
+  const [N, D] = input[0];
+  const Info = input.slice(1);
+  const dp = Array(D + 1).fill(Infinity);
+  dp[0] = 0;
+
+  const graph = Array.from({ length: D + 1 }, () => []);
+  for (const [start, end, 지름길] of Info) {
+    if (end > D) continue;
+    if (end - start <= 지름길) continue;
+    graph[start].push([end, 지름길]);
+  }
+
+  for (let i = 0; i <= D; i++) {
+    if (i > 0) dp[i] = Math.min(dp[i], dp[i - 1] + 1);
+
+    for (const [end, 지름길] of graph[i]) {
+      if (dp[end] > dp[i] + 지름길) {
+        dp[end] = dp[i] + 지름길;
+      }
+    }
+  }
+
+  return dp[D];
+}
+
+console.log(solution(input));

live10/test107/문제3/황장현.js

@@ -0,0 +1,31 @@
+function solution(n) {
+  const triangle = Array.from({ length: n }, (_, i) => Array(i + 1).fill(0));
+  const total = (n * (n + 1)) / 2;
+
+  const dx = [1, 0, -1];
+  const dy = [0, 1, -1];
+
+  let x = 0,
+    y = 0,
+    dir = 0,
+    num = 1;
+
+  while (num <= total) {
+    triangle[x][y] = num++;
+    let nx = x + dx[dir];
+    let ny = y + dy[dir];
+
+    if (nx < 0 || ny < 0 || nx >= n || ny > nx || triangle[nx][ny] !== 0) {
+      dir = (dir + 1) % 3;
+      nx = x + dx[dir];
+      ny = y + dy[dir];
+    }
+
+    x = nx;
+    y = ny;
+  }
+
+  return triangle.flat();
+}
+
+console.log(solution(4));