const readline = require("readline"); const rl = readline.createInterface({ input: process.stdin, output: process.stdout, }); const Queue = () => { const queue = []; let start = 0; let end = 0; const push = (elem) => { queue.push(elem); end++; }; const pop = () => { return queue[start++]; }; return { push, pop, get length() { return end - start; }, }; }; const near = [ [-1, 0], [1, 0], [0, -1], [0, 1], ]; let index = 0; let n, m; let cheese = []; rl.on("line", (line) => { if (index === 0) { [n, m] = line.split(" ").map(Number); } else { cheese.push(line.split(" ").map(Number)); if (index === n) { let outer = 0; let outerCount = 0; let currentSpace = 2; let cheeseCount = 0; for (let i = 0; i < n; i++) { for (let j = 0; j < m; j++) { if (cheese[i][j] === 1) { cheeseCount++; continue; } if (cheese[i][j] === 0) { cheese[i][j] = currentSpace; const queue = Queue(); queue.push([i, j]); let currentCount = 1; while (queue.length) { const [x, y] = queue.pop(); for (const [dx, dy] of near) { const [nx, ny] = [x + dx, y + dy]; if (nx < 0 || nx >= n) continue; if (ny < 0 || ny >= m) continue; if (cheese[nx][ny] !== 0) continue; cheese[nx][ny] = currentSpace; currentCount++; queue.push([nx, ny]); } } if (currentCount > outerCount) { outer = currentSpace++; outerCount = currentCount; } } } } let t = 0; while (true) { if (cheeseCount === 0) break; for (let i = 0; i < n; i++) { for (let j = 0; j < m; j++) { if (cheese[i][j] === 1) continue; if (cheese[i][j] === outer) continue; for (const [dx, dy] of near) { const [nx, ny] = [i + dx, j + dy]; if (nx < 0 || nx >= n) continue; if (ny < 0 || ny >= m) continue; if (cheese[nx][ny] === outer) { cheese[i][j] = outer; break; } } } } for (let i = 0; i < n; i++) { for (let j = 0; j < m; j++) { if (cheese[i][j] === 1) { let nearOuter = 0; for (const [dx, dy] of near) { const [nx, ny] = [i + dx, j + dy]; if (nx < 0 || nx >= n) continue; if (ny < 0 || ny >= m) continue; if (cheese[nx][ny] == outer) nearOuter++; } if (nearOuter >= 2) { cheese[i][j] = 0; cheeseCount--; } } } } t++; } console.log(t); rl.close(); } } index++; });

제출 #128306

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력: