<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>

class Solution:
    def countSubIslands(self, grid1: List[List[int]], grid2: List[List[int]]) -> int:
        import numpy as np
        grid1 = np.array(grid1)
        grid2 = np.array(grid2)
        grid1 = np.array(grid1*grid2,dtype = "bool")
        g1 = np.zeros((len(grid2)+2,len(grid2[0])+2),dtype="bool")
        g1[1:-1,1:-1] = grid2
        p4=(g1[1:-1,:-2] )*(g1[1:-1,1:-1])
        p3=(g1[1:-1,2:] )*(g1[1:-1,1:-1] )
        p2=(g1[:-2,1:-1] )*(g1[1:-1,1:-1] )
        p1=(g1[2:,1:-1] )*(g1[1:-1,1:-1] )
        p0 = np.array([p1,p2,p3,p4])

        cur_r = 1
        g1_i = np.zeros_like(grid2,dtype="uint")
        for i in range(len(grid2)):
            for j in range(len(grid2[0])):
                if grid2[i,j] and 0== g1_i[i,j] and grid1[i,j]:
                    cur_set = set()
                    seen = set()
                    g1_i[i,j] = cur_r
                    cur_set.add(tuple((i,j)))
                    update = True
                    while update:
                        update = False
                        new_set = set()
                        for k in cur_set:
                            if k not in seen:
                                seen.add(k)
                                (x,y) = k
                                tp0 = p0[:,x,y]
                                if tp0.any():
                                    if tp0[0] and not g1_i[x+1,y]:
                                        g1_i[x+1,y] = cur_r
                                        new_set.add(tuple((x+1,y)))
                                        update = True

                                    if tp0[1] and not g1_i[x-1,y]:
                                        g1_i[x-1,y] = cur_r
                                        new_set.add(tuple((x-1,y)))
                                        update = True
                                    if tp0[2] and not g1_i[x,y+1]:
                                        g1_i[x,y+1] = cur_r
                                        new_set.add(tuple((x,y+1)))
                                        update = True
                                    if tp0[3] and not g1_i[x,y-1]:
                                        g1_i[x,y-1] = cur_r
                                        new_set.add(tuple((x,y-1)))
                                        update = True
                        cur_set = cur_set.union(new_set-seen)

                    cur_r+=1
        outint=0
        
        a = np.unique(g1_i[np.invert(grid1)])
        b = np.unique(g1_i)
        return b[b>0].size-a[a>0].size
        # for i in np.unique(g1_i):
        #     if i>0:
        #         if ((g1_i==i)==(g1_i==i)*grid1).all():
        #             outint +=1           
                    
        # return outint
49150