<p>An <code>n x n</code> grid is composed of <code>1 x 1</code> squares where each <code>1 x 1</code> square consists of a <code>&#39;/&#39;</code>, <code>&#39;\&#39;</code>, or blank space <code>&#39; &#39;</code>. These characters divide the square into contiguous regions.</p>

<p>Given the grid <code>grid</code> represented as a string array, return <em>the number of regions</em>.</p>

<p>Note that backslash characters are escaped, so a <code>&#39;\&#39;</code> is represented as <code>&#39;\\&#39;</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2018/12/15/1.png" style="width: 200px; height: 200px;" />
<pre>
<strong>Input:</strong> grid = [&quot; /&quot;,&quot;/ &quot;]
<strong>Output:</strong> 2
</pre>

<p><strong class="example">Example 2:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2018/12/15/2.png" style="width: 200px; height: 198px;" />
<pre>
<strong>Input:</strong> grid = [&quot; /&quot;,&quot;  &quot;]
<strong>Output:</strong> 1
</pre>

<p><strong class="example">Example 3:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2018/12/15/4.png" style="width: 200px; height: 200px;" />
<pre>
<strong>Input:</strong> grid = [&quot;/\\&quot;,&quot;\\/&quot;]
<strong>Output:</strong> 5
<strong>Explanation: </strong>Recall that because \ characters are escaped, &quot;\\/&quot; refers to \/, and &quot;/\\&quot; refers to /\.
</pre>

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

<ul>
	<li><code>n == grid.length == grid[i].length</code></li>
	<li><code>1 &lt;= n &lt;= 30</code></li>
	<li><code>grid[i][j]</code> is either <code>&#39;/&#39;</code>, <code>&#39;\&#39;</code>, or <code>&#39; &#39;</code>.</li>
</ul>

class Solution {
public:
   void dfs(int row,int col,vector<vector<int>>&matrix,vector<vector<int>>&vis){
    vis[row][col]=1;
    int dx[]={-1,1,0,0};
    int dy[]={0,0,1,-1};

    for(int idx=0;idx<4;idx++){
        int newRow=row+dx[idx];
        int newCol=col+dy[idx];
        if(newRow<matrix.size()&&newCol<matrix[0].size()&&newRow>=0&&newCol>=0&&vis[newRow][newCol]==0&&matrix[newRow][newCol]==0){
            // cout<<vis[newRow][newCol]<<endl;
            vis[newRow][newCol]=1;
            // cout<<vis[newRow][newCol]<<endl;
            // cout<<newRow<<" "<<newCol<<endl;
            dfs(newRow,newCol,matrix,vis);
        }
    }
}
    int regionsBySlashes(vector<string>& grid) {
    int n=grid.size();
    vector<vector<int>>matrix;
    for(int i=0;i<n;i++){
        int m=grid[0].size();
        vector<int>curr_row1;
        vector<int>curr_row2;
        vector<int>curr_row3;
        for(int col=0;col<m;col++){
            if(grid[i][col]==' '){
                curr_row1.push_back(0);
                curr_row1.push_back(0);
                curr_row1.push_back(0);
                curr_row2.push_back(0);
                curr_row2.push_back(0);
                curr_row2.push_back(0);
                  curr_row3.push_back(0);
                curr_row3.push_back(0);
                curr_row3.push_back(0);
            }
            else if(grid[i][col]=='/'){
              curr_row1.push_back(0);
                curr_row1.push_back(0);
                curr_row1.push_back(1);
                curr_row2.push_back(0);
                curr_row2.push_back(1);
                curr_row2.push_back(0);
                  curr_row3.push_back(1);
                curr_row3.push_back(0);
                curr_row3.push_back(0);

            }
            else{
              curr_row1.push_back(1);
                curr_row1.push_back(0);
                curr_row1.push_back(0);
                curr_row2.push_back(0);
                curr_row2.push_back(1);
                curr_row2.push_back(0);
                  curr_row3.push_back(0);
                curr_row3.push_back(0);
                curr_row3.push_back(1);

            }
        }
        matrix.push_back(curr_row1);
        matrix.push_back(curr_row2);
        matrix.push_back(curr_row3);
    }
    int noOfRow=matrix.size();
    int noOfCOl=matrix[0].size();
    vector<vector<int>>vis(noOfRow,vector<int>(noOfCOl,0));
    int cnt=0;
    for(int row=0;row<noOfRow;row++){
        for(int col=0;col<noOfCOl;col++){
            cout<<matrix[row][col];
            if(!vis[row][col]&&matrix[row][col]==0){
                cnt++;
                //  cout<<row<<" "<<col<<endl;
                dfs(row,col,matrix,vis);
            }
        }
        cout<<endl;
    }
    return cnt;
        
    }
};
20783