<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)
        ans = 1
        arry = []
        state = collections.defaultdict(set)
        directions = {}
        directions[0] = [(0,1,(0,1,4)),(1,0,(0,1,3)),(0,-1,(0,2,3)),(-1,0,(0,2,4))]
        directions[1]= [(0,-1,(0,2,3)),(-1,0,(0,2,4))]
        directions[2] = [(0,1,(0,1,4)),(1,0,(0,1,3))]
        directions[3] = [(-1,0,(0,2,4)),(0,1,(0,1,4))]
        directions[4] = [(1,0,(0,1,3)),(0,-1,(0,2,3))]
        # 0,1,2,3,4
        # 1,
        # 2

        # 3
        # 4,
        for i in range(n):
            tmp = []
            pre = ""
            for j in range(n):
                #print(grid[i][j])
                if pre == "\\" and grid[i][j] == "\\":
                    continue
                else:
                    if grid[i][j] == "/":
                        tmp.append(0)
                        pre = 0
                    elif grid[i][j] == "\\":
                        tmp.append(1)
                        pre = 1
                    else:
                        tmp.append(-1)
                        pre = -1
                    
            arry.append(tmp)
        #print(arry)
        for i in range(n):
            for j in range(n):
                if arry[i][j] == 0:
                    state[i,j].add(1)
                    state[i,j].add(2)
                elif arry[i][j] == 1:
                    state[i,j].add(3)
                    state[i,j].add(4)
                else:
                    state[i,j].add(0)
        seen = {}
        visit = collections.defaultdict(int)
        def is_ok(s,ss):
            if s == 0:
                return True
            elif s == 1:
                if ss == 0 or ss == 2 or ss ==4:return True
            elif s == 2:
                if ss == 0 or ss == 1 or ss ==3:return True
            elif s == 3:
                if ss == 0 or ss%2==0:return True
            elif s == 4:
                if ss ==0 or ss%2:return True
            return False
        def dfs(i,j,s,k):
            seen[i,j,s] = k
            for x,y,state_list in directions[s]:
                new_x = x + i
                new_y = y + j
                for ss in state_list:
                    if 0<=new_x< n and 0<=new_y<n and (new_x,new_y,ss) not in seen and ss in state[new_x,new_y]:
                        print(i,j,s,new_x,new_y,ss)
                        dfs(new_x,new_y,ss,k)
        cur = 0
        #print(state)
        for i in range(n):
            for j in range(n):
                for ss in state[i,j]:
                    if (i,j,ss) not in seen:
                        dfs(i,j,ss,cur)
                        cur+=1
        #print(seen)
        return cur
21256