<p>You are given a <code>m x n</code> matrix <code>grid</code>. Initially, you are located at the top-left corner <code>(0, 0)</code>, and in each step, you can only <strong>move right or down</strong> in the matrix.</p>

<p>Among all possible paths starting from the top-left corner <code>(0, 0)</code> and ending in the bottom-right corner <code>(m - 1, n - 1)</code>, find the path with the <strong>maximum non-negative product</strong>. The product of a path is the product of all integers in the grid cells visited along the path.</p>

<p>Return the <em>maximum non-negative product <strong>modulo</strong> </em><code>10<sup>9</sup> + 7</code>. <em>If the maximum product is <strong>negative</strong>, return </em><code>-1</code>.</p>

<p>Notice that the modulo is performed after getting the maximum product.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/12/23/product1.jpg" style="width: 244px; height: 245px;" />
<pre>
<strong>Input:</strong> grid = [[-1,-2,-3],[-2,-3,-3],[-3,-3,-2]]
<strong>Output:</strong> -1
<strong>Explanation:</strong> It is not possible to get non-negative product in the path from (0, 0) to (2, 2), so return -1.
</pre>

<p><strong class="example">Example 2:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/12/23/product2.jpg" style="width: 244px; height: 245px;" />
<pre>
<strong>Input:</strong> grid = [[1,-2,1],[1,-2,1],[3,-4,1]]
<strong>Output:</strong> 8
<strong>Explanation:</strong> Maximum non-negative product is shown (1 * 1 * -2 * -4 * 1 = 8).
</pre>

<p><strong class="example">Example 3:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/12/23/product3.jpg" style="width: 164px; height: 165px;" />
<pre>
<strong>Input:</strong> grid = [[1,3],[0,-4]]
<strong>Output:</strong> 0
<strong>Explanation:</strong> Maximum non-negative product is shown (1 * 0 * -4 = 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;= 15</code></li>
	<li><code>-4 &lt;= grid[i][j] &lt;= 4</code></li>
</ul>

class Solution {
public:
    int maxProductPath(vector<vector<int>>& grid) {
        queue<pair<long long,pair<int,int>>> q;
        q.push({grid[0][0],{0,0}});
        int del[] = {-1,0,1,0,-1};
        int mod =1e9+7;
        int m =grid.size(),n=grid[0].size();
        long long ans =INT_MIN;
        vector<vector<long long>> pos(m,vector<long long>(n,INT_MIN)),neg(m,vector<long long>(n,1));
        if(grid[0][0]>=0){
            pos[0][0] =grid[0][0];
        }else{
            neg[0][0] = grid[0][0];
        }
        while(q.size()){
            auto it = q.front();
            long long prod = it.first;
            int r = it.second.first,c=it.second.second;
            q.pop();
            cout<<prod<<endl;
            if(r==m-1&&c==n-1){
                ans=max(ans,prod);
                ans=ans;
                continue;
            }
            if(c+1<n){
                long long temp = (prod*grid[r][c+1]);
                bool flag=false;
                if(temp>=0){
                    if(pos[r][c+1]<temp){
                        pos[r][c+1] =temp;
                        flag=true;
                    }
                }else{
                    if((neg[r][c+1])>(temp)){
                        neg[r][c+1] = temp;
                        flag=true;
                    }
                }
                if(flag)
                {cout<<"r: "<<r<<" c+1:"<<c+1<<endl;
                q.push({temp,{r,c+1}});}
            }
            if(r+1<m){
                long long temp = (prod*grid[r+1][c]);
                bool flag=false;
                if(temp>=0){
                    if(pos[r+1][c]<temp){
                        pos[r+1][c]=temp;
                        flag=true;
                    }
                }else{
                    if((neg[r+1][c])>(temp)){
                        neg[r+1][c]=temp;
                        flag=true;
                    }
                }
                if(flag)
                {cout<<"r+1: "<<r<<" c:"<<c+1<<endl;
                q.push({temp,{r+1,c}});}
            }
        }
        for(int i=0;i<m;i++){
            for(int j=0;j<n;j++){
                cout<<pos[i][j]<<" ";
            }
            cout<<endl;
        }
        for(int i=0;i<m;i++){
            for(int j=0;j<n;j++){
                cout<<neg[i][j]<<" ";
            }
            cout<<endl;
        }
        if(ans<0) return -1;
        return ans%mod;   
    }
};
14900