<p>You are given a <strong>0-indexed</strong> 2D integer array <code>grid</code> of size <code>m x n</code>. Each cell has one of two values:</p>

<ul>
	<li><code>0</code> represents an <strong>empty</strong> cell,</li>
	<li><code>1</code> represents an <strong>obstacle</strong> that may be removed.</li>
</ul>

<p>You can move up, down, left, or right from and to an empty cell.</p>

<p>Return <em>the <strong>minimum</strong> number of <strong>obstacles</strong> to <strong>remove</strong> so you can move from the upper left corner </em><code>(0, 0)</code><em> to the lower right corner </em><code>(m - 1, n - 1)</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2022/04/06/example1drawio-1.png" style="width: 605px; height: 246px;" />
<pre>
<strong>Input:</strong> grid = [[0,1,1],[1,1,0],[1,1,0]]
<strong>Output:</strong> 2
<strong>Explanation:</strong> We can remove the obstacles at (0, 1) and (0, 2) to create a path from (0, 0) to (2, 2).
It can be shown that we need to remove at least 2 obstacles, so we return 2.
Note that there may be other ways to remove 2 obstacles to create a path.
</pre>

<p><strong class="example">Example 2:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2022/04/06/example1drawio.png" style="width: 405px; height: 246px;" />
<pre>
<strong>Input:</strong> grid = [[0,1,0,0,0],[0,1,0,1,0],[0,0,0,1,0]]
<strong>Output:</strong> 0
<strong>Explanation:</strong> We can move from (0, 0) to (2, 4) without removing any obstacles, so we return 0.
</pre>

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

<ul>
	<li><code>m == grid.length</code></li>
	<li><code>n == grid[i].length</code></li>
	<li><code>1 &lt;= m, n &lt;= 10<sup>5</sup></code></li>
	<li><code>2 &lt;= m * n &lt;= 10<sup>5</sup></code></li>
	<li><code>grid[i][j]</code> is either <code>0</code> <strong>or</strong> <code>1</code>.</li>
	<li><code>grid[0][0] == grid[m - 1][n - 1] == 0</code></li>
</ul>

class Solution:
    def minimumObstacles(self, grid: List[List[int]]) -> int:
        dp = [[inf for i in range(len(grid[0]))] for j in range(len(grid))]
        #vis = [[False for i in range(len(grid[0]))] for j in range(len(grid))]
        pq = []
        dp[0][0] = 0
        if len(grid[0]) > 1:
            heapq.heappush(pq,[(1 if grid[0][1] == 1 else 0), 0,1])
            dp[0][1] = (1 if grid[0][1] == 1 else 0)
        if len(grid) > 1:
            heapq.heappush(pq,[(1 if grid[1][0] == 1 else 0), 1,0])
            dp[1][0] = (1 if grid[1][0] == 1 else 0)
        
        while len(pq) > 0:
            t = heapq.heappop(pq)
            x = t[1]
            y = t[2]
            for dx,dy in ([-1,0],[1,0],[0,-1],[0,1]) :
                if x+dx >= 0 and x+dx < len(grid) and y +dy >=0 and y+dy < len(grid[0]):
                    if dp[x+dx][y+dy] == inf:
                        heapq.heappush(pq,[t[0] + (1 if grid[x+dx][y+dy] == 1 else 0), x+dx, y+dy])
                        dp[x+dx][y+dy] = t[0] + (1 if grid[x+dx][y+dy] == 1 else 0)
                    else:
                        dp[x+dx][y+dy] = min(dp[x+dx][y+dy], t[0]+(1 if grid[x+dx][y+dy] == 1 else 0))
        
        return dp[len(grid)-1][len(grid[0])-1]

4049