<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:
    def regionsBySlashes(self, grid: List[str]) -> int:
        r1 = len(grid)
        c1 = len(grid[0])
        r2 = r1*3
        c2 = c1*3

        scaledGridSet = set()
        for i in range(r1):
            for j in range(c1):
                k = 3*i
                l = 3*j
                
                if grid[i][j] == '/':
                    scaledGridSet.add((k,l))
                    scaledGridSet.add((k,l+1))

                    scaledGridSet.add((k+1,l))
                    scaledGridSet.add((k+1,l+2))

                    scaledGridSet.add((k+2,l+1))
                    scaledGridSet.add((k+2,l+2))
                elif grid[i][j] == '\\':
                    scaledGridSet.add((k,l+1))
                    scaledGridSet.add((k,l+2))
                    
                    scaledGridSet.add((k+1,l))
                    scaledGridSet.add((k+1,l+2))

                    scaledGridSet.add((k+2,l+1))
                    scaledGridSet.add((k+2,l))

                else:
                    scaledGridSet.add((k,l))
                    scaledGridSet.add((k,l+1))
                    scaledGridSet.add((k,l+2))

                    scaledGridSet.add((k+1,l))
                    scaledGridSet.add((k+1,l+1))
                    scaledGridSet.add((k+1,l+2))

                    scaledGridSet.add((k+2,l))
                    scaledGridSet.add((k+2,l+1))
                    scaledGridSet.add((k+2,l+2))
            

        def mark(a,b):
        
            if (a,b+1) in scaledGridSet:
                scaledGridSet.remove((a,b+1))
                mark(a,b+1)
            if (a+1,b) in scaledGridSet:
                scaledGridSet.remove((a+1,b))
                mark(a+1,b)
            if (a-1,b) in scaledGridSet:
                scaledGridSet.remove((a-1,b))
                mark(a-1,b)
            if (a,b-1) in scaledGridSet:
                scaledGridSet.remove((a,b-1))
                mark(a,b-1)
        res = 0
        while len(scaledGridSet) > 0:
                  
            res+=1
            a,b = scaledGridSet.pop()
            mark(a,b)
 
        return res
            

        

21909