https://www.acmicpc.net/problem/13335코드const fs = require("fs");const filePath = process.platform === "linux" ? "dev/stdin" : "./input.txt";const [n, w, l, ...arr] = fs .readFileSync(filePath) .toString() .trim() .split(/\s/) .filter((item) => item != "") .map((item) => +item);class TruckNode { constructor(weight) { this.next = null; this.weight = weight; this.dist = 0; }}class ..
문제풀이/자료구조
https://www.acmicpc.net/problem/1374코드from heapq import heappop, heappushimport sysinput = sys.stdin.readlinen = int(input())lectures = []for _ in range(n): _, start, end = map(int, input().split()) lectures.append((start, end))lectures.sort()needs = []for i in range(n): start, end = lectures[i] if needs and needs[0] 이 문제는 heap 자료구조를 잘 알고 사용하는 것이 중요한 문제였다.1. 강의 정보 정렬 1-1. 각 강의의 시작 ..
https://www.acmicpc.net/problem/2910코드from heapq import heappop, heappushimport sysinput = sys.stdin.readlinen, c = map(int, input().split())arr = list(map(int, input().split()))count_dict = dict()for i in range(n): if arr[i] not in count_dict: count_dict[arr[i]] = [i, 1] else: count_dict[arr[i]][1] += 1hq = []for k, v in count_dict.items(): heappush(hq, [-v[1], v[0], k])w..
https://www.acmicpc.net/problem/15828파이썬 코드(100점)import sysfrom collections import dequeinput = sys.stdin.readlinen = int(input())q = deque()while True: input_data = int(input()) if input_data == -1: break if input_data == 0: q.popleft() continue if len(q) >= n: continue else: q.append(input_data)if len(q) > 0: print(" ".join(list(map(str, q))..
https://www.acmicpc.net/problem/1158코드const fs = require("fs");const filePath = process.platform === "linux" ? "dev/stdin" : "input.txt";const [n, k] = fs .readFileSync(filePath) .toString() .trim() .split(" ") .map((item) => +item);class Node { constructor(value) { this.value = value; this.prev = null; this.next = null; } setPrev(prev) { this.prev = prev; } setNext(next) {..
