<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 {
public:
    
    bool isCycle(int node, vector<int>adj[], vector<int>& vis) {
        vis[node] = 1;
        for(auto nextNode : adj[node]) {
            if(vis[nextNode] == 2) continue;
            if(vis[nextNode] == 1) return true;
            if(isCycle(nextNode, adj, vis)) {
                return true;
            }
        }
        vis[node] = 2;
        return false;
    }

    bool isPrintable(vector<vector<int>>& targetGrid) {
        
        int n = targetGrid.size();
        int m = targetGrid[0].size();

        vector<int>adj[61];

        for(int color = 1 ; color <= 60; color++) {
            
            int miniX = 60;
            int miniY = 60;
            int maxiX = -1;
            int maxiY = -1;

            for(int i = 0; i < n; i++) {
                for(int j = 0; j < m; j++) {
                    if(targetGrid[i][j] == color) {
                        miniX = min(miniX, i);
                        miniY = min(miniY, j);
                        maxiX = max(maxiX, i);
                        maxiY = max(maxiY, j);
                    }
                }
            }

            cout<<miniX<<" "<<miniY<<" "<<maxiX<<" "<<maxiY<<endl;

            for(int x = miniX; x <= maxiX; x++) {
                for(int y = miniY; y <= maxiY; y++) {
                    if(targetGrid[x][y] != color) {
                        adj[color].push_back(targetGrid[x][y]);
                        // cout<<i<<" "<<targetGrid[x][y]<<endl;
                    }
                }
            }

        }

        vector<int>vis(61, 0);

        for(int i = 1; i <= 60; i++) {
            if(vis[i] == 0) {
                if(isCycle(i, adj, vis)) {
                    return false;
                }
            }
        }

        return true;

    }
};
37373