<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>> sl = {{0, 0, 1}, {0, 1, 0}, {1, 0, 0}};
    vector<vector<int>> bl = {{1, 0, 0}, {0, 1, 0}, {0, 0, 1}};
    vector<vector<int>> em = {{0, 0, 0}, {0, 0, 0}, {0, 0, 0}};
     int row, col;
    bool ok(int i , int j , vector<vector<int>> &graph , vector<vector<bool>> &vis){
        if(i >=0 && i < graph.size() && j >=0 && j < graph[0].size() && graph[i][j] == 0 && vis[i][j] == false){
            return true;
        }
        return false;

    }
    void dfs(int i , int j , vector<vector<int>> &graph , vector<vector<bool>> &vis){
        vis[i][j] =true;
        // left
        if(ok(i+1 , j, graph , vis)){
            dfs(i+1 ,j , graph , vis);
        }
        if(ok(i , j+1, graph , vis)){
            dfs(i ,j+1 , graph , vis);
        }
        if(ok(i-1 , j, graph , vis)){
            dfs(i-1 ,j , graph , vis);
        }
        if(ok(i , j-1, graph , vis)){
            dfs(i ,j-1, graph , vis);
        }

    }

    int regionsBySlashes(vector<string>& grid) {
        int n =grid.size();
        row = n;
        col = grid[0].size();
       // int graph[row * 3][col * 3];
        vector<vector<int>> graph (row*3, vector<int> (col*3));
       /// memset(graph, 0, sizeof(graph));

        for (int i = 0; i < grid.size(); i++) {
            for (int j = 0; j < grid[0].size(); j++) {

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

                } else if (grid[i][j] == '\\') {
                    graph[i * 3][j * 3] = 1;
                    graph[i * 3 + 1][j * 3 + 1] = 1;
                    graph[i * 3 + 2][j * 3 + 2] = 1;
                }
            }

        }
        int ans =0;
        vector<vector<bool>> vis (row*3, vector<bool> (col*3));
        for(int i = 0 ;i < graph.size(); i++){
            for(int j = 0 ; j < graph[0].size(); j++){
                if(vis[i][j]== false && graph[i][j] == 0){
                    dfs(i , j ,graph , vis);
                    ans++;
                }
            }
        }
        for(auto tt : graph){
            for(auto it : tt){
                cout << it << " ";
            }
            cout << endl;
        }
        cout << ans<< endl;
        

        return ans;
    }
};
17733