๐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);