<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:
        n = len(grid)
        result = 0

        if n == 1:
            if grid[0][0] == ' ':
                return result + 1
            else:
                return result + 2

        big_rows, big_cols = n * 3, n * 3
        print(big_rows, big_cols)
        big_grid = [[0 for _ in range(big_cols)] for _ in range(big_rows)]

        for row in range(n):
            for col in range(n):
                if grid[row][col] == '\\':
                    big_row, big_col = row * 3, col * 3
                    big_grid[big_row][big_col] = 1
                    big_grid[big_row + 1][big_col + 1] = 1
                    big_grid[big_row + 2][big_col + 2] = 1

                elif grid[row][col] == '/':
                    big_row, big_col = row * 3, col * 3
                    big_grid[big_row][big_col + 2] = 1
                    big_grid[big_row + 1][big_col + 1] = 1
                    big_grid[big_row + 2][big_col] = 1

        def dfs(r, c):
            if 0 > r or r >= big_rows or 0 > c or c >= big_cols or (r, c) in seen or big_grid[r][c] == 1:
                return

            seen.add((r, c))

            neighbors = [[r+1, c], [r-1, c], [r, c+1], [r, c-1]]
            for neighbor in neighbors:
                r, c = neighbor[0], neighbor[1]
                dfs(r, c)

        seen = set()
        for row in range(big_rows):
            for col in range(big_cols):
                if (row, col) not in seen and big_grid[row][col] == 0:
                    dfs(row, col)
                    result += 1

        return result
23214