<p>There is a strange printer with the following two special requirements:</p>

<ul>
	<li>On each turn, the printer will print a solid rectangular pattern of a single color on the grid. This will cover up the existing colors in the rectangle.</li>
	<li>Once the printer has used a color for the above operation, <strong>the same color cannot be used again</strong>.</li>
</ul>

<p>You are given a <code>m x n</code> matrix <code>targetGrid</code>, where <code>targetGrid[row][col]</code> is the color in the position <code>(row, col)</code> of the grid.</p>

<p>Return <code>true</code><em> if it is possible to print the matrix </em><code>targetGrid</code><em>,</em><em> otherwise, return </em><code>false</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/12/23/print1.jpg" style="width: 600px; height: 175px;" />
<pre>
<strong>Input:</strong> targetGrid = [[1,1,1,1],[1,2,2,1],[1,2,2,1],[1,1,1,1]]
<strong>Output:</strong> true
</pre>

<p><strong class="example">Example 2:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/12/23/print2.jpg" style="width: 600px; height: 367px;" />
<pre>
<strong>Input:</strong> targetGrid = [[1,1,1,1],[1,1,3,3],[1,1,3,4],[5,5,1,4]]
<strong>Output:</strong> true
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> targetGrid = [[1,2,1],[2,1,2],[1,2,1]]
<strong>Output:</strong> false
<strong>Explanation:</strong> It is impossible to form targetGrid because it is not allowed to print the same color in different turns.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>m == targetGrid.length</code></li>
	<li><code>n == targetGrid[i].length</code></li>
	<li><code>1 &lt;= m, n &lt;= 60</code></li>
	<li><code>1 &lt;= targetGrid[row][col] &lt;= 60</code></li>
</ul>

class Solution:
    def isPrintable(self, targetGrid):
        from collections import defaultdict

        colorBoundingBox = {}
        numRows = len(targetGrid)
        numCols = len(targetGrid[0])

        for row in range(numRows):
            for col in range(numCols):
                color = targetGrid[row][col]
                if color not in colorBoundingBox:
                    colorBoundingBox[color] = [row, col, row, col]
                else:
                    boundingBox = colorBoundingBox[color]
                    boundingBox[0] = min(boundingBox[0], row)
                    boundingBox[1] = min(boundingBox[1], col)
                    boundingBox[2] = max(boundingBox[2], row)
                    boundingBox[3] = max(boundingBox[3], col)

        adjacencyList = defaultdict(set)
        for color in colorBoundingBox:
            for row in range(colorBoundingBox[color][0], colorBoundingBox[color][2] + 1):
                for col in range(colorBoundingBox[color][1], colorBoundingBox[color][3] + 1):
                    if targetGrid[row][col] != color:
                        adjacencyList[color].add(targetGrid[row][col])

        colorVisitState = {}
        
        def hasCycle(currentColor):
            if colorVisitState.get(currentColor, 0) == 1:
                return True
            if colorVisitState.get(currentColor, 0) == 2:
                return False
            colorVisitState[currentColor] = 1
            if currentColor in adjacencyList:
                for neighborColor in adjacencyList[currentColor]:
                    if hasCycle(neighborColor):
                        return True
            colorVisitState[currentColor] = 2
            return False

        for color in colorBoundingBox:
            if hasCycle(color):
                return False

        return True

17800