<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:
    vector<vector<int>> gridN, visited;
    int n,m;
    void dfs(int i, int j) {
        if(i>=3*n || j>= 3*m || i<0 || j<0)
            return;
        if(gridN[i][j] == 0)
            return;
        if(visited[i][j])
            return;
        visited[i][j] = 1;
        dfs(i+1,j);
        dfs(i-1,j);
        dfs(i,j+1);
        dfs(i,j-1);
        return;
    }

    void printVec(vector<vector<int>> vec) {
        for(int i=0;i<size(vec);i++) {
            for(int j=0;j<size(vec[i]);j++) {
                cout << vec[i][j] << " ";
            }
            cout << endl;
        }
    }

    int regionsBySlashes(vector<string>& grid) {
        n=size(grid),m=size(grid[0]);
        gridN.resize(3*n, vector<int>(3*m, 1));
        visited.resize(3*n, vector<int>(3*m, 0));

        for(int i=0;i<n;i++) {
            for(int j=0;j<m;j++) {
                cout << grid[i][j] << " " << (grid[i][j] == '\\') << " " << (grid[i][j] == '/') << endl;
                if(grid[i][j] == '\\') {
                    cout << "hehe\n";
                    gridN[3*i][3*j]=0;
                    gridN[3*i+1][3*j+1]=0;
                    gridN[3*i+2][3*j+2]=0;
                }
                if(grid[i][j] == '/') {
                    cout << "haha\n";
                    gridN[3*i+2][3*j]=0;
                    gridN[3*i+1][3*j+1]=0;
                    gridN[3*i][3*j+2]=0;
                }
            }
        }
        printVec(gridN);
        int ans=0;
        for(int i=0;i<3*n;i++) {
            for(int j=0;j<3*m;j++) {
                if(!visited[i][j] && gridN[i][j]==1) {
                    dfs(i,j);
                    ans++;
                }
            }
        }
        return ans;
    }
};
17428