{"status": "success", "data": {"description_md": "**Author:** munch\n\nPoseidon is playing a game on a $69 \\times 420$ grid. At the start of the game, he floods $k$ squares. Now, every second after the start of the game, if a cell is adjacent (doesn't include diagonally adjacent cells) to at least $2$ flooded cells, it becomes flooded. If a cell is flooded, it stays flooded. The game ends when no more cells can be flooded. What's the minimum value of $k$ such that we can flood all cells?", "description_html": "<p><strong>Author:</strong> munch</p>&#10;<p>Poseidon is playing a game on a <span class=\"katex--inline\">69 \\times 420</span> grid. At the start of the game, he floods <span class=\"katex--inline\">k</span> squares. Now, every second after the start of the game, if a cell is adjacent (doesn&#8217;t include diagonally adjacent cells) to at least <span class=\"katex--inline\">2</span> flooded cells, it becomes flooded. If a cell is flooded, it stays flooded. The game ends when no more cells can be flooded. What&#8217;s the minimum value of <span class=\"katex--inline\">k</span> such that we can flood all cells?</p>&#10;", "hints_md": "", "hints_html": "", "editorial_md": "", "editorial_html": "", "flag_hint": "", "point_value": 6, "problem_name": "Floods", "can_next": false, "can_prev": false, "nxt": "", "prev": ""}}