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

제출 #14610

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: