<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 typing import Tuple, List
from collections import defaultdict

class Solution:
    def __init__(self):

        self.counter_of_islands = 0
        self.has_already_been = set()
        self.matrix = None


    def countSubIslands(self, grid1: List[List[int]], grid2: List[List[int]]) -> int:

        self.matrix = grid2[:][:]

        while True:

            if not any([1 in line for line in self.matrix]):
                return self.counter_of_islands

            for i , line in enumerate(self.matrix):
                for j, v in enumerate(line):

                    if v:
                        self.has_already_been.clear()
                        self.island_handler(i, j)

                        if all([grid1[_i][_j] for _i, _j in self.has_already_been]):
                            self.counter_of_islands += 1

                        for _i, _j in self.has_already_been:
                            self.matrix[_i][_j] = 0
                

    def island_handler(self, i: int, j: int):
        self.has_already_been.add((i, j))

        if i-1 >= 0 and \
            (i-1, j) not in self.has_already_been and \
            self.matrix[i-1][j]:

            self.island_handler(i-1, j)
        
        if j-1 >= 0 and \
            (i, j-1) not in self.has_already_been and \
            self.matrix[i][j-1]:

            self.island_handler(i, j-1)

        if i+1 < len(self.matrix) and \
            (i+1, j) not in self.has_already_been and \
            self.matrix[i+1][j]:

            self.island_handler(i+1, j)

        if j+1 < len(self.matrix[0]) and \
            (i, j+1) not in self.has_already_been and \
            self.matrix[i][j+1]:

            self.island_handler(i, j+1)

33490