๐Ÿ”’Algorithm

๋ฐฑ์ค€[JS] > 1620๋ฒˆ ๋‚˜๋Š”์•ผ ํฌ์ผ“๋ชฌ ๋งˆ์Šคํ„ฐ ์ด๋‹ค์†œ

devWarrior 2025. 1. 13. 15:41

๋ฌธ์ œ๋งํฌ

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

๋ฌธ์ œํ’€์ด

map์„ ์ด์šฉํ•ด์„œ ์‰ฝ๊ฒŒ ํ’€ ์ˆ˜ ์žˆ์—ˆ๋‹ค. ๊ฐ์ฒด๋ฅผ ์ด์šฉํ•˜์ง€ ์•Š๋Š”๋‹ค๋ฉด ์‹œ๊ฐ„๋ณต์žก๋„๊ฐ€ ์˜ฌ๋ผ๊ฐ€ ์‹œ๊ฐ„์ดˆ๊ณผ๋กœ ๋ฌธ์ œ๋ฅผ ํ’€ ์ˆ˜ ์—†๋‹ค. 

let fs = require("fs");
let input = fs.readFileSync("/dev/stdin").toString().trim().split("\n");

let [N, M] = input
    .shift()
    .split(" ")
    .map((n) => +n);

let map = new Map();

let answer = "";
for (let i = 0; i < input.length; ++i) {
    if (i < N) {
        // ๋„๊ฐ ๋งŒ๋“ค๊ธฐ
        map.set(`${i + 1}`, input[i]);
        map.set(input[i], `${i + 1}`);
    } else {
        answer += `${map.get(input[i])}\n`;
    }
}

console.log(answer);