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

void dfs(int i,int j,vector<vector<int>>&matrix,vector<vector<int>>&vis){
    vis[i][j]=1;

    int rr[]={0,0,-1,1};
    int cc[]={1,-1,0,0};

    for(int k=0;k<4;k++){
        int newr=rr[k]+i;
        int newc=cc[k]+j;

        if(newr>=0&&newr<matrix.size()&&newc>=0&&newc<matrix[0].size()&&vis[newr][newc]==0&&matrix[newr][newc]==1){

            dfs(newr,newc,matrix,vis);
        }
    }

}
    bool hasValidPath(vector<vector<int>>& grid) {
        int row=grid.size();
        int col=grid[0].size();

        vector<vector<int>>matrix(row*3,vector<int>(col*3,0));

 vector<vector<int>>vis(row*3,vector<int>(col*3,0));
        for(int i=0;i<row;i++){

            for(int j=0;j<col;j++){

                if(grid[i][j]==1){
                    matrix[i*3+1][j*3]=1;
                    matrix[i*3+1][j*3+1]=1;
                    matrix[i*3+1][j*3+2]=1;

                }
                else if(grid[i][j]==2){
                    matrix[i*3][j*3+1]=1;
                     matrix[i*3+1][j*3+1]=1;
                      matrix[i*3+2][j*3+1]=1;
                }
                else if(grid[i][j]==3){
                      matrix[i*3+1][j*3]=1;
                    matrix[i*3+1][j*3+1]=1;
                      matrix[i*3+2][j*3+1]=1;
                }
                else if(grid[i][j]==4){
                       matrix[i*3+1][j*3+1]=1;
                       matrix[i*3+1][j*3+2]=1;
                      matrix[i*3+2][j*3+1]=1;
                }
                else if(grid[i][j]==5){
                       matrix[i*3][j*3+1]=1;
                       matrix[i*3+1][j*3]=1;
                      matrix[i*3+1][j*3+1]=1;
                }
                else if(grid[i][j]==6){
                       matrix[i*3][j*3+1]=1;
                       matrix[i*3+1][j*3+1]=1;
                      matrix[i*3+1][j*3+2]=1;
                }
            }
        }

      if(vis[1][1]==0){
          dfs(1,1,matrix,vis);
      }
   

        if(vis[matrix.size()-2][matrix[0].size()-2]==1)return true;
        // if(vis[matrix.size()-2][matrix[0].size()-1]==1)return true;
        return false;

        
    }
};
124935