// 17144 미세먼지 안녕! // https://www.acmicpc.net/problem/17144 const PURIFIER = -1; function solution() { const { room, time } = processInput(); const purifier = findPurifier(room); let currRoom = room; let timeRemain = time; while (0 < timeRemain) { const nextRoom = diffuse(currRoom, purifier); circulate(purifier[0], true, nextRoom); circulate(purifier[1], false, nextRoom); currRoom = nextRoom; timeRemain--; } return calculateTotalDustAmount(currRoom); } function processInput() { const [[, , time], ...room] = require("fs").readFileSync("/dev/stdin").toString().trim() .split("\n") .map((v) => v.split(" ").map(Number)); return { room, time }; } function findPurifier(room) { let purifier = [ [0, 0], [0, 0], ]; for (let r = 2; r < room.length - 2; r++) { if (room[r][0] === PURIFIER) { purifier = [ [r, 0], [r + 1, 0], ]; break; } } return purifier; } function diffuse(currRoom, purifier) { const dR = [-1, 0, 1, 0]; const dC = [0, 1, 0, -1]; const rowSize = currRoom.length; const colSize = currRoom[0].length; const nextRoom = Array.from({ length: rowSize }, () => new Array(colSize).fill(0)); purifier.forEach(([r, c]) => { nextRoom[r][c] = PURIFIER; }); for (let r = 0; r < rowSize; r++) { for (let c = 0; c < colSize; c++) { const cell = currRoom[r][c]; if (cell === PURIFIER) continue; const dustAmount = cell; if (dustAmount === 0) continue; let dustAmountRemain = dustAmount; const diffusionAmount = Math.trunc(dustAmount / 5); for (let i = 0; i < 4; i++) { const [adjR, adjC] = [r + dR[i], c + dC[i]]; const inRoom = 0 <= adjR && adjR < rowSize && 0 <= adjC && adjC < colSize; if (inRoom && currRoom[adjR][adjC] !== PURIFIER) { nextRoom[adjR][adjC] += diffusionAmount; dustAmountRemain -= diffusionAmount; } } nextRoom[r][c] += dustAmountRemain; } } return nextRoom; } function circulate(start, upperBody, room) { const rowSize = room.length; const colSize = room[0].length; const [up, down, right, left] = [ [-1, 0], [1, 0], [0, 1], [0, -1], ]; const dirs = upperBody ? [up, right, down, left] : [down, right, up, left]; let [currR, currC] = start; for (const [dR, dC] of dirs) { while (true) { const [nextR, nextC] = [currR + dR, currC + dC]; const inRoom = upperBody ? 0 <= nextR && nextR <= start[0] && 0 <= nextC && nextC < colSize : start[0] <= nextR && nextR < rowSize && 0 <= nextC && nextC < colSize; if (inRoom === false) break; if (room[currR][currC] !== PURIFIER) { room[currR][currC] = room[nextR][nextC]; } if (room[nextR][nextC] === PURIFIER) { room[currR][currC] = 0; } [currR, currC] = [nextR, nextC]; } } } function calculateTotalDustAmount(room) { return room.flat().reduce((totalDustAmount, cell) => { if (cell === PURIFIER) { totalDustAmount += cell; } return totalDustAmount; }, 0); } console.log(solution());

제출 #14607

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: