Class Solution
java.lang.Object
g1001_1100.s1001_grid_illumination.Solution
1001 - Grid Illumination.<p>Hard</p>
<p>There is a 2D <code>grid</code> of size <code>n x n</code> where each cell of this grid has a lamp that is initially <strong>turned off</strong>.</p>
<p>You are given a 2D array of lamp positions <code>lamps</code>, where <code>lamps[i] = [row<sub>i</sub>, col<sub>i</sub>]</code> indicates that the lamp at <code>grid[row<sub>i</sub>][col<sub>i</sub>]</code> is <strong>turned on</strong>. Even if the same lamp is listed more than once, it is turned on.</p>
<p>When a lamp is turned on, it <strong>illuminates its cell</strong> and <strong>all other cells</strong> in the same <strong>row, column, or diagonal</strong>.</p>
<p>You are also given another 2D array <code>queries</code>, where <code>queries[j] = [row<sub>j</sub>, col<sub>j</sub>]</code>. For the <code>j<sup>th</sup></code> query, determine whether <code>grid[row<sub>j</sub>][col<sub>j</sub>]</code> is illuminated or not. After answering the <code>j<sup>th</sup></code> query, <strong>turn off</strong> the lamp at <code>grid[row<sub>j</sub>][col<sub>j</sub>]</code> and its <strong>8 adjacent lamps</strong> if they exist. A lamp is adjacent if its cell shares either a side or corner with <code>grid[row<sub>j</sub>][col<sub>j</sub>]</code>.</p>
<p>Return <em>an array of integers</em> <code>ans</code><em>,</em> <em>where</em> <code>ans[j]</code> <em>should be</em> <code>1</code> <em>if the cell in the</em> <code>j<sup>th</sup></code> <em>query was illuminated, or</em> <code>0</code> <em>if the lamp was not.</em></p>
<p><strong>Example 1:</strong></p>
<p><img src="https://assets.leetcode.com/uploads/2020/08/19/illu_1.jpg" alt="" /></p>
<p><strong>Input:</strong> n = 5, lamps = [[0,0],[4,4]], queries = [[1,1],[1,0]]</p>
<p><strong>Output:</strong> [1,0]</p>
<p><strong>Explanation:</strong> We have the initial grid with all lamps turned off. In the above picture we see the grid after turning on the lamp at grid[0][0] then turning on the lamp at grid[4][4]. The 0<sup>th</sup> query asks if the lamp at grid[1][1] is illuminated or not (the blue square). It is illuminated, so set ans[0] = 1. Then, we turn off all lamps in the red square. <img src="https://assets.leetcode.com/uploads/2020/08/19/illu_step1.jpg" alt="" /> The 1<sup>st</sup> query asks if the lamp at grid[1][0] is illuminated or not (the blue square). It is not illuminated, so set ans[1] = 0. Then, we turn off all lamps in the red rectangle. <img src="https://assets.leetcode.com/uploads/2020/08/19/illu_step2.jpg" alt="" /></p>
<p><strong>Example 2:</strong></p>
<p><strong>Input:</strong> n = 5, lamps = [[0,0],[4,4]], queries = [[1,1],[1,1]]</p>
<p><strong>Output:</strong> [1,1]</p>
<p><strong>Example 3:</strong></p>
<p><strong>Input:</strong> n = 5, lamps = [[0,0],[0,4]], queries = [[0,4],[0,1],[1,4]]</p>
<p><strong>Output:</strong> [1,1,0]</p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>1 <= n <= 10<sup>9</sup></code></li>
<li><code>0 <= lamps.length <= 20000</code></li>
<li><code>0 <= queries.length <= 20000</code></li>
<li><code>lamps[i].length == 2</code></li>
<li><code>0 <= row<sub>i</sub>, col<sub>i</sub> < n</code></li>
<li><code>queries[j].length == 2</code></li>
<li><code>0 <= row<sub>j</sub>, col<sub>j</sub> < n</code></li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
gridIllumination
public int[] gridIllumination(int n, int[][] lamps, int[][] queries)
-