<p>You are given two <code>m x n</code> binary matrices <code>grid1</code> and <code>grid2</code> containing only <code>0</code>&#39;s (representing water) and <code>1</code>&#39;s (representing land). An <strong>island</strong> is a group of <code>1</code>&#39;s connected <strong>4-directionally</strong> (horizontal or vertical). Any cells outside of the grid are considered water cells.</p>

<p>An island in <code>grid2</code> is considered a <strong>sub-island </strong>if there is an island in <code>grid1</code> that contains <strong>all</strong> the cells that make up <strong>this</strong> island in <code>grid2</code>.</p>

<p>Return the <em><strong>number</strong> of islands in </em><code>grid2</code> <em>that are considered <strong>sub-islands</strong></em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/06/10/test1.png" style="width: 493px; height: 205px;" />
<pre>
<strong>Input:</strong> grid1 = [[1,1,1,0,0],[0,1,1,1,1],[0,0,0,0,0],[1,0,0,0,0],[1,1,0,1,1]], grid2 = [[1,1,1,0,0],[0,0,1,1,1],[0,1,0,0,0],[1,0,1,1,0],[0,1,0,1,0]]
<strong>Output:</strong> 3
<strong>Explanation: </strong>In the picture above, the grid on the left is grid1 and the grid on the right is grid2.
The 1s colored red in grid2 are those considered to be part of a sub-island. There are three sub-islands.
</pre>

<p><strong class="example">Example 2:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/06/03/testcasex2.png" style="width: 491px; height: 201px;" />
<pre>
<strong>Input:</strong> grid1 = [[1,0,1,0,1],[1,1,1,1,1],[0,0,0,0,0],[1,1,1,1,1],[1,0,1,0,1]], grid2 = [[0,0,0,0,0],[1,1,1,1,1],[0,1,0,1,0],[0,1,0,1,0],[1,0,0,0,1]]
<strong>Output:</strong> 2 
<strong>Explanation: </strong>In the picture above, the grid on the left is grid1 and the grid on the right is grid2.
The 1s colored red in grid2 are those considered to be part of a sub-island. There are two sub-islands.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>m == grid1.length == grid2.length</code></li>
	<li><code>n == grid1[i].length == grid2[i].length</code></li>
	<li><code>1 &lt;= m, n &lt;= 500</code></li>
	<li><code>grid1[i][j]</code> and <code>grid2[i][j]</code> are either <code>0</code> or <code>1</code>.</li>
</ul>

from queue import Queue
class Solution:
    def countSubIslands(self, grid1: List[List[int]], grid2: List[List[int]]) -> int:
        visited_map = {}
        islands = []
        num_of_islands = 0
        for r in range(len(grid2)):
            for c in range(len(grid2[0])):
                island = self.search(visited_map, r, c, grid2)
                if len(island) > 0:
                    islands.append(island)
        
        for island in islands:
            all_hits = True
            i = 0
            while(all_hits and i < len(island)):
                r = island[i][0]
                c = island[i][1]
                if grid1[r][c] != grid2[r][c]:
                    all_hits = False
                i += 1
            
            if all_hits:
                num_of_islands +=1

        return num_of_islands




    
    def search(self, visited_map, start_r, start_c, grid2):
        directions = [(1,0), (0,1), (-1,0), (0, -1)]
        coord = (start_r, start_c)
        if coord not in visited_map:
            visited_map[coord] = True
        elif visited_map[coord]:
            return []

        if grid2[start_r][start_c] == 0:
            return []

        tiles_in_island = []
        q = Queue()
        q.put(coord)
        tiles_in_island.append(coord)
        while(not q.empty()):
            tile = q.get()
            for direction in directions:
                new_coord = (tile[0] + direction[0], tile[1] + direction[1])
                if new_coord[0] < 0 or new_coord[1] < 0 or new_coord[0] >= len(grid2) or new_coord[1] >= len(grid2[0]):
                    continue
                else:
                    if grid2[new_coord[0]][new_coord[1]] == 1 and (new_coord not in visited_map or not visited_map[new_coord]):
                        tiles_in_island.append(new_coord)
                        q.put(new_coord)
                        visited_map[new_coord] = True

        return tiles_in_island

        
64810