Count Unguarded Cells in the Grid
You receive two integers m and n representing a 0-indexed m x n grid. You are also provided two 2D integer arrays guards and walls where guards[i] = [row i, col i ] and walls[j] = [row j, col j ] represent the positions of the i th guard and j th wall respectively.
A guard can see every cell in the four cardinal directions (north, east, south, or west) starting from their position unless obstructed by a wall or another guard. A cell is guarded if there is at least one guard that can see it.
Produce the number of unoccupied cells that are not guarded.
Input: m = 4, n = 6, guards = [[0,0],[1,1],[2,3]], walls = [[0,1],[2,2],[1,4]]
Output: 7
Explanation: The guarded and unguarded cells are shown in red and green respectively in the above diagram.
There are a total of 7 unguarded cells, so we produce 7.
Input: m = 3, n = 3, guards = [[1,1]], walls = [[0,1],[1,0],[2,1],[1,2]]
Output: 4
Explanation: The unguarded cells are shown in green in the above diagram.
There are a total of 4 unguarded cells, so we produce 4.
Constraints
1 <= m, n <= 10^52 <= m * n <= 10^51 <= guards.length, walls.length <= 5 * 10^42 <= guards.length + walls.length <= m * nguards[i].length == walls[j].length == 20 <= row i, row j < m0 <= col i, col j < n- All the positions in
guardsandwallsare unique.
Did this problem appear in one of your interviews?
Responses stay private.