<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>>mgrid;
        for(auto &s: grid){
            vector<int>top;
            vector<int>middle;
            vector<int>bottom;
            for(int i=0;i<s.size();i++){
                if(s[i]==' '){
                    top.insert(top.end(),{0,0,0});
                    middle.insert(middle.end(),{0,0,0});
                    bottom.insert(bottom.end(),{0,0,0});
                }else if(s[i]=='/'){
                    top.insert(top.end(),{0,0,1});
                    middle.insert(middle.end(),{0,1,0});
                    bottom.insert(bottom.end(),{1,0,0});
                }else{
                    top.insert(top.end(),{1,0,0});
                    middle.insert(middle.end(),{0,1,0});
                    bottom.insert(bottom.end(),{0,0,1});
                }
            }
            mgrid.push_back(top);
            mgrid.push_back(middle);
            mgrid.push_back(bottom);
        }
        int sol=0;
        for(int i=0;i<mgrid.size();i++){
            for(int j=0;j<mgrid[i].size();j++){
                if(mgrid[i][j]==0){
                    sol++;
                    queue<pair<int,int>>q;
                    q.push({i,j});
                    mgrid[i][j]=1;
                    while(!q.empty()){
                        auto top=q.front();
                        q.pop();
                        int x=top.first,y=top.second;
                        if(x>0&&mgrid[x-1][y]==0){
                            q.push({x-1,y});
                            mgrid[x-1][y]=1;
                        }
                        if(y>0&&mgrid[x][y-1]==0){
                            q.push({x,y-1});
                            mgrid[x][y-1]=1;
                        }
                        if(x+1<mgrid.size()&&mgrid[x+1][y]==0){
                            q.push({x+1,y});
                            mgrid[x+1][y]=1;
                        }
                        if(y+1<mgrid[i].size()&&mgrid[x][y+1]==0){
                            q.push({x,y+1});
                            mgrid[x][y+1]=1;
                        }
                    }
                }
            }
        }
        return sol;
    }
};
23223