Node.js) 백준 5014번: 스타트링크

https://www.acmicpc.net/problem/5014

5014번: 스타트링크

 

class Node {
	constructor(item) {
		this.item = item;
		this.next = null;
	}
}

class Queue {
	constructor() {
		this.head = null;
		this.tail = null;
		this.length = 0;
	}

	push(item) {
		const node = new Node(item);
		if (this.head == null) {
			this.head = node;
		} else {
			this.tail.next = node;
		}

		this.tail = node;
		this.length += 1;
	}

	pop() {
		const popItem = this.head;
		this.head = this.head.next;
		this.length -= 1;
		return popItem.item;
	}
}
const fs = require('fs');
const input = fs.readFileSync('./dev/stdin').toString().trim().split('\n');
const [F, S, G, U, D] = input.shift().split(' ').map(Number);
// F  총 층수
// G  목적지
// S  출발지
// U  위
// D  아래

let visited = Array(1000001).fill(Infinity);
const q = new Queue();
q.push([S, 0]);
visited[S] = 0;

while (q.length > 0) {
	const [now, cnt] = q.pop();
	if (now == G) {
		console.log(cnt);
		process.exit();
	}
	const up = now + U;
	if (up <= F && visited[up] == Infinity) {
		visited[up] = cnt + 1;
		q.push([up, cnt + 1]);
	}

	const down = now - D;
	if (down > 0 && visited[down] == Infinity) {
		visited[down] = cnt + 1;
		q.push([down, cnt + 1]);
	}
}
console.log('use the stairs');