접근 : 구현
Javascript
let input = require("fs")
.readFileSync("input.txt") //"/dev/stdin"
.toString()
.trim()
.split("\n")
.map((val) => val.trim());
function solution(input) {
//input
let [n, l] = input[0].split(" ").map((v) => +v);
for (let i = 1; i < input.length; i++) {}
let time = 0;
let distance = 0;
for (let i = 1; i <= n; i++) {
let [D, R, G] = input[i].split(" ").map((v) => +v);
time += D - distance;
distance = D;
let check = time % (R + G);
if (check < R) {
time += R - check;
} else {
continue;
}
}
time += l - distance;
console.log(time);
}
solution(input);
'코딩테스트(알고리즘) > baekjoon' 카테고리의 다른 글
[baekjoon] 2563 색종이 (Javascript) (0) | 2022.06.22 |
---|---|
[baekjoon] 8979 올림픽 (Javascript) (0) | 2022.06.22 |
[baekjoon] 개미 3048 (Javascript) (0) | 2022.06.20 |
[baekjoon] 쇠막대기 10799 (Javascript,c++) (0) | 2022.06.18 |
[baekjoon] 그림 1926 (C++) (0) | 2022.06.17 |