Merge pull request #630 from eric-hjh/main

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

Author: github-actions[bot]

live9/test92/문제1/황장현.js

@@ -0,0 +1,88 @@
+class MinHeap {
+  constructor() {
+    this.heap = [];
+  }
+  push(value) {
+    this.heap.push(value);
+    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 index = this.heap.length - 1;
+
+    while (index > 0) {
+      const parentIndex = Math.floor((index - 1) / 2);
+      if (this.heap[parentIndex] <= this.heap[index]) break;
+      [this.heap[parentIndex], this.heap[index]] = [
+        this.heap[index],
+        this.heap[parentIndex],
+      ];
+      index = parentIndex;
+    }
+  }
+
+  // 루트 값을 뺐을 때 재정렬
+  bubbleDown() {
+    let index = 0;
+    const length = this.heap.length;
+
+    while (true) {
+      const left = 2 * index + 1;
+      const right = 2 * index + 2;
+      let smallest = index;
+
+      if (left < length && this.heap[left] < this.heap[smallest]) {
+        smallest = left;
+      }
+
+      if (right < length && this.heap[right] < this.heap[smallest]) {
+        smallest = right;
+      }
+
+      if (smallest === index) break;
+
+      [this.heap[index], this.heap[smallest]] = [
+        this.heap[smallest],
+        this.heap[index],
+      ];
+
+      index = smallest;
+    }
+  }
+
+  least() {
+    return this.heap[0];
+  }
+
+  size() {
+    return this.heap.length;
+  }
+}
+
+function solution(scoville, K) {
+  scoville.sort((a, b) => a - b);
+  if (scoville[0] >= K) return 0;
+
+  const minHeap = new MinHeap();
+  scoville.forEach((s) => minHeap.push(s));
+  let mixCount = 0;
+  while (minHeap.size() > 1 && minHeap.least() < K) {
+    const first = minHeap.pop();
+    const second = minHeap.pop();
+    const newScoville = first + second * 2;
+    minHeap.push(newScoville);
+    mixCount++;
+  }
+
+  return minHeap.least() >= K ? mixCount : -1;
+}
+
+console.log(solution([1, 2, 3, 9, 10, 12], 7));

live9/test92/문제2/황장현.js

@@ -0,0 +1,52 @@
+function solution(board, skill) {
+  let count = 0;
+  let effectMap = Array.from({ length: board.length + 1 }, () =>
+    Array(board[0].length + 1).fill(0)
+  );
+
+  for (let i = 0; i < skill.length; ++i) {
+    const [skillType, r1, c1, r2, endCol, degree] = skill[i];
+    const adjustedImpact = skillType === 1 ? -degree : degree;
+
+    effectMap[r1][c1] += adjustedImpact;
+    effectMap[r1][endCol + 1] -= adjustedImpact;
+    effectMap[r2 + 1][c1] -= adjustedImpact;
+    effectMap[r2 + 1][endCol + 1] += adjustedImpact;
+  }
+
+  for (let i = 0; i < board.length; ++i) {
+    for (let j = 0; j < board[i].length; ++j) {
+      if (i > 0) effectMap[i][j] += effectMap[i - 1][j];
+      if (j > 0) effectMap[i][j] += effectMap[i][j - 1];
+      if (i > 0 && j > 0) effectMap[i][j] -= effectMap[i - 1][j - 1];
+    }
+  }
+
+  for (let i = 0; i < board.length; ++i) {
+    for (let j = 0; j < board[i].length; ++j) {
+      board[i][j] += effectMap[i][j];
+      if (board[i][j] > 0) {
+        count++;
+      }
+    }
+  }
+
+  return count;
+}
+
+console.log(
+  solution(
+    [
+      [5, 5, 5, 5, 5],
+      [5, 5, 5, 5, 5],
+      [5, 5, 5, 5, 5],
+      [5, 5, 5, 5, 5],
+    ],
+    [
+      [1, 0, 0, 3, 4, 4],
+      [1, 2, 0, 2, 3, 2],
+      [2, 1, 0, 3, 1, 2],
+      [1, 0, 1, 3, 3, 1],
+    ]
+  )
+);

live9/test92/문제3/황장현.js

@@ -0,0 +1,39 @@
+function solution(book_time) {
+  const toMinutes = (time) => {
+    const [hour, minute] = time.split(':').map(Number);
+    return hour * 60 + minute;
+  };
+
+  book_time.sort((a, b) => toMinutes(a[0]) - toMinutes(b[0]));
+
+  const rooms = [];
+
+  for (const [start, end] of book_time) {
+    const startTime = toMinutes(start);
+    const endTime = toMinutes(end) + 10;
+
+    let earliestRoomIndex = rooms.findIndex(
+      (roomEndTime) => roomEndTime <= startTime
+    );
+
+    if (earliestRoomIndex !== -1) {
+      rooms[earliestRoomIndex] = endTime;
+    } else {
+      rooms.push(endTime);
+    }
+
+    rooms.sort((a, b) => a - b);
+  }
+
+  return rooms.length;
+}
+
+console.log(
+  solution([
+    ['15:00', '17:00'],
+    ['16:40', '18:20'],
+    ['14:20', '15:20'],
+    ['14:10', '19:20'],
+    ['18:20', '21:20'],
+  ])
+);