<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:
    int regionsBySlashes(vector<string>& grid) {
        vector<vector<int>> gridWithZerosAndOnes;

        for(int i = 0; i < grid.size(); i++) {
            vector<int> temp1;
            vector<int> temp2;
            vector<int> temp3;

            for(int j = 0; j < grid[0].size(); j++) {
                if(grid[i][j] == ' ') {
                    temp1.push_back(0);
                    temp1.push_back(0);
                    temp1.push_back(0);
                    temp2.push_back(0);
                    temp2.push_back(0);
                    temp2.push_back(0);
                    temp3.push_back(0);
                    temp3.push_back(0);
                    temp3.push_back(0);
                }
                else{
                    if(grid[i][j] == '/') {
                        temp1.push_back(0);
                        temp1.push_back(0);
                        temp1.push_back(1);
                        temp2.push_back(0);
                        temp2.push_back(1);
                        temp2.push_back(0);
                        temp3.push_back(1);
                        temp3.push_back(0);
                        temp3.push_back(0);
                    }
                    else {
                        temp1.push_back(1);
                        temp1.push_back(0);
                        temp1.push_back(0);
                        temp2.push_back(0);
                        temp2.push_back(1);
                        temp2.push_back(0);
                        temp3.push_back(0);
                        temp3.push_back(0);
                        temp3.push_back(1);
                    }
                }
            }

            gridWithZerosAndOnes.push_back(temp1);
            gridWithZerosAndOnes.push_back(temp2);
            gridWithZerosAndOnes.push_back(temp3);
        }

        int row = gridWithZerosAndOnes.size();
        int col = gridWithZerosAndOnes[0].size();
        int visit[row][col];
        memset(visit, 0, sizeof(visit));

        queue<pair<int, int>> q;
        int numOfIsLands = 0;

        for(int i = 0; i < row; i++) {
            for(int j = 0; j < col; j++) {
                if(visit[i][j] == 0 && gridWithZerosAndOnes[i][j] == 0) {
                    q.push({i, j});
                    visit[i][j] = 1;
                    numOfIsLands++;

                    while(!q.empty()) {
                        int r = q.front().first;
                        int c = q.front().second;
                        q.pop();

                        for(int r1 = -1; r1 <= 1; r1++) {
                            for(int c1 = -1; c1 <= 1; c1++) {
                                int r11 = r + r1;
                                int c11 = c + c1;
                                bool isValid = (r1 != c1) && (r1 == 0 || c1 == 0) && r11 >= 0 && r11 < row && c11 >= 0 && c11 < col;
                                if(isValid && visit[r11][c11] == 0 && gridWithZerosAndOnes[r11][c11] == 0) {
                                    visit[r11][c11] = 1;
                                    q.push({r11, c11});
                                }
                            }
                        }
                    }
                }
            }
        }

        return numOfIsLands;
    }
};
22156