<p>You are given an <code>m x n</code> <code>grid</code>. Each cell of <code>grid</code> represents a street. The street of <code>grid[i][j]</code> can be:</p>

<ul>
	<li><code>1</code> which means a street connecting the left cell and the right cell.</li>
	<li><code>2</code> which means a street connecting the upper cell and the lower cell.</li>
	<li><code>3</code> which means a street connecting the left cell and the lower cell.</li>
	<li><code>4</code> which means a street connecting the right cell and the lower cell.</li>
	<li><code>5</code> which means a street connecting the left cell and the upper cell.</li>
	<li><code>6</code> which means a street connecting the right cell and the upper cell.</li>
</ul>
<img alt="" src="https://assets.leetcode.com/uploads/2020/03/05/main.png" style="width: 450px; height: 708px;" />
<p>You will initially start at the street of the upper-left cell <code>(0, 0)</code>. A valid path in the grid is a path that starts from the upper left cell <code>(0, 0)</code> and ends at the bottom-right cell <code>(m - 1, n - 1)</code>. <strong>The path should only follow the streets</strong>.</p>

<p><strong>Notice</strong> that you are <strong>not allowed</strong> to change any street.</p>

<p>Return <code>true</code><em> if there is a valid path in the grid or </em><code>false</code><em> otherwise</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2020/03/05/e1.png" style="width: 455px; height: 311px;" />
<pre>
<strong>Input:</strong> grid = [[2,4,3],[6,5,2]]
<strong>Output:</strong> true
<strong>Explanation:</strong> As shown you can start at cell (0, 0) and visit all the cells of the grid to reach (m - 1, n - 1).
</pre>

<p><strong class="example">Example 2:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2020/03/05/e2.png" style="width: 455px; height: 293px;" />
<pre>
<strong>Input:</strong> grid = [[1,2,1],[1,2,1]]
<strong>Output:</strong> false
<strong>Explanation:</strong> As shown you the street at cell (0, 0) is not connected with any street of any other cell and you will get stuck at cell (0, 0)
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> grid = [[1,1,2]]
<strong>Output:</strong> false
<strong>Explanation:</strong> You will get stuck at cell (0, 1) and you cannot reach cell (0, 2).
</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;= 300</code></li>
	<li><code>1 &lt;= grid[i][j] &lt;= 6</code></li>
</ul>

class Solution {
public:
    bool hasValidPath(vector<vector<int>>& grid) 
    {
        //if(grid[grid.size()-1][grid[0].size()-1]!=6 && grid[grid.size()-1][grid[0].size()-1]!=1){return false;}
        int p1=0, p2=0;
        vector<vector<int>>v(grid.size(), vector<int>(grid[0].size(), 0));
        vector<vector<int>>v1(grid.size(), vector<int>(grid[0].size(), 1));
        queue<pair<int, int>>q;
        v[0][0]=1;
        q.push({0, 0});
        while(!q.empty())
        {
            int x=q.front().first, y=q.front().second;
            p1=x; p2=y;
            //cout<<x<<" "<<y<<endl;
            q.pop();
            //if(v==v1){break;}
            if(x==grid.size()-1 && y==grid[0].size()-1){return true;}
            if(grid[x][y]==1)
            {
                if(y<grid[0].size()-1 && !v[x][y+1] && (grid[x][y+1]==3 || grid[x][y+1]==5 || grid[x][y+1]==1))
                {
                    v[x][y+1]=1;
                    q.push({x, y+1});
                }
                if(y>0 && !v[x][y-1] && (grid[x][y-1]==4 || grid[x][y-1]==6 || grid[x][y-1]==1))
                {
                    v[x][y-1]=1;
                    q.push({x, y-1});
                }
            }
            //if(grid[x][y]==2){
            else if(grid[x][y]==2)
            {
                if(x<grid.size()-1 && !v[x+1][y] && (grid[x+1][y]==5 || grid[x+1][y]==6 || grid[x+1][y]==2))
                {
                    v[x+1][y]=1;
                    q.push({x+1, y});
                }
                if(x>0 && !v[x-1][y] && (grid[x-1][y]==4 || grid[x-1][y]==3 || grid[x-1][y]==2))
                {
                    q.push({x-1, y});
                    v[x-1][y]=1;
                }
            }
            else if(grid[x][y]==3)
            {
                if(x<grid.size()-1 && !v[x+1][y] && (grid[x+1][y]==5 || grid[x+1][y]==6 || grid[x+1][y]==2))
                {
                    v[x+1][y]=1;
                    q.push({x+1, y});
                }
                if(y>0 && !v[x][y-1] && (grid[x][y-1]==4 || grid[x][y-1]==6 || grid[x][y-1]==1))
                {
                    q.push({x, y-1});
                    v[x][y-1]=1;
                }
            }
            else if(grid[x][y]==4){
                if(x<grid.size()-1 && !v[x+1][y] && (grid[x+1][y]==5 || grid[x+1][y]==6 || grid[x+1][y]==2))
                {
                    v[x+1][y]=1;
                    q.push({x+1, y});
                }
                if(y<grid[0].size()-1 && !v[x][y+1] && (grid[x][y+1]==1 || grid[x][y+1]==3) || grid[x][y+1]==5)
                {
                    q.push({x, y+1});
                    v[x][y+1]=1;
                }
            }
            else if(grid[x][y]==5)
            {
                if(x>0 && !v[x-1][y] && (grid[x-1][y]==2 || grid[x-1][y]==3 || grid[x-1][y]==4))
                {
                    v[x-1][y]=1;
                    q.push({x-1, y});
                }
                if(y>0 && !v[x][y-1] && (grid[x][y-1]==1 || grid[x][y-1]==4 || grid[x][y-1]==3))
                {
                    q.push({x, y-1});
                    v[x][y-1]=1;
                }
            }
            else if(grid[x][y]==6)
            {
                if(x>0 && !v[x-1][y] && (grid[x-1][y]==1 || grid[x-1][y]==3 || grid[x-1][y]==5))
                {
                    v[x-1][y]=1;
                    q.push({x-1, y});
                }
                if(y<grid[0].size()-1 && !v[x][y+1] && (grid[x][y+1]==1 || grid[x][y+1]==3 || grid[x][y+1]==5))
                {
                    q.push({x, y+1});
                    v[x][y+1]=1;
                }
            }
        }
        for(int i=0; i<v.size(); i++)
        {
            for(int j=0; j<v[0].size(); j++)
            {
                cout<<v[i][j]<<" ";
            }cout<<endl;
        }
        if(p1!=grid.size()-1 && p2!=grid[0].size()-1){return false;}
        if(v[grid.size()-1][grid[0].size()-1]==0){return false;}
        return true;
    }
};
67754