Merge pull request #747 from eric-hjh/main

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

Author: github-actions[bot]

live12/test123/문제1/황장현.js

@@ -0,0 +1,40 @@
+const input = require('fs')
+  .readFileSync(process.platform === 'linux' ? '/dev/stdin' : './input.txt')
+  .toString()
+  .trim()
+  .split('\n')
+  .map(Number);
+
+const G = input[0];
+const P = input[1];
+const planes = input.slice(2);
+
+const parent = Array.from({ length: G + 1 }, (_, i) => i);
+
+function find(x) {
+  if (parent[x] === x) return x;
+  return (parent[x] = find(parent[x]));
+}
+
+function union(x, y) {
+  const rootX = find(x);
+  const rootY = find(y);
+  if (rootX !== rootY) {
+    parent[rootX] = rootY;
+  }
+}
+
+let answer = 0;
+
+for (let i = 0; i < P; i++) {
+  const gate = planes[i];
+  const availableGate = find(gate);
+
+  if (availableGate === 0) break;
+
+  union(availableGate, availableGate - 1);
+
+  answer++;
+}
+
+console.log(answer);

live12/test123/문제2/황장현.js

@@ -0,0 +1,29 @@
+const input = require('fs')
+  .readFileSync(process.platform === 'linux' ? '/dev/stdin' : './input.txt')
+  .toString()
+  .trim()
+  .split('\n')
+  .map((el) => el.split(' ').map(Number));
+
+const N = input[0][0];
+const lines = input.slice(1).sort((a, b) => a[0] - b[0]);
+
+let totalLength = 0;
+let currentStart = lines[0][0];
+let currentEnd = lines[0][1];
+
+for (let i = 1; i < N; i++) {
+  const [start, end] = lines[i];
+
+  if (start <= currentEnd) {
+    currentEnd = Math.max(currentEnd, end);
+  } else {
+    totalLength += currentEnd - currentStart;
+    currentStart = start;
+    currentEnd = end;
+  }
+}
+
+totalLength += currentEnd - currentStart;
+
+console.log(totalLength);