Merge pull request #522 from dongmin115/main

[임동민] 64차 라이브코테 제출

Author: eric-hjh

live6/test64/문제1/임동민.js

@@ -0,0 +1,19 @@
+const input = require('fs')
+    .readFileSync(process.platform === 'linux' ? '/dev/stdin' : './input.txt')
+    .toString()
+    .trim()
+    .split('')
+    .map(Number);
+
+function solution() {
+    input.sort((a,b) => b - a);
+    const sum = input.reduce((a,b) => a + b, 0);
+
+    if(sum % 3 !== 0 || input[input.length -1] !== 0){
+        console.log(-1);
+    } else {
+        console.log(input.join(''));
+    }
+}
+
+solution();

live6/test64/문제2/임동민.js

@@ -0,0 +1,41 @@
+const input = require('fs')
+    .readFileSync(process.platform === 'linux' ? '/dev/stdin' : './input.txt')
+    .toString()
+    .trim()
+    .split('\n')
+    .map(e => e.split(' ').map(Number));
+
+function solution() {
+    const [N,K] = input[0];
+    const testCase = input.slice(1);
+    let sum = 0;
+    const window = 2 * K + 1;
+
+    let maxPosition = 0;
+
+    for (let i = 0; i < N; i++) {
+        const [, position] = testCase[i];
+        if (position > maxPosition) maxPosition = position;
+    }
+
+    const arr = new Array(maxPosition+1).fill(0);
+
+    testCase.forEach(([ices,position]) => {
+        arr[position] += ices;
+    })
+
+    for(let i=0; i<= Math.min(maxPosition, window - 1); i++) {
+        sum += arr[i];
+    }
+
+    let max = sum;
+
+    for(let i=window; i<=maxPosition; i++) {
+        sum += arr[i] - arr[i-window];
+        max = Math.max(max, sum);
+    }
+
+    console.log(max);
+}
+
+solution();

live6/test64/문제3/임동민.js

@@ -0,0 +1,27 @@
+function solution(cacheSize, cities) {
+    const stack = [];
+    let time = 0;
+
+    if(cacheSize === 0){
+        return cities.length * 5;
+    }
+
+    cities.forEach(e => {
+        const lower = e.toLowerCase();
+        if(stack.includes(lower)){
+            time += 1;
+            stack.splice(stack.indexOf(lower),1);
+            stack.push(lower);
+        } else {
+            time += 5;
+
+            if(stack.length >= cacheSize){
+                stack.shift();
+            }
+
+            stack.push(lower);
+        }
+
+    })
+    return time;
+}