<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 {
    bool cycle(unordered_map<int, set<int>>& adj) {
        unordered_map<int, int> indegree;

        for (auto [key, vec] : adj) {
            if (indegree.find(key) == indegree.end())
                indegree[key] = 0;
            for (int i : vec) {
                indegree[i]++;
            }
        }

        for (auto [key, deg] : indegree)
            cout << deg << " ";
        cout << endl;

        queue<int> q;
        for (auto [key, deg] : indegree) {
            if (deg == 0)
                q.push(key);
        }

        while (!q.empty()) {
            int top = q.front();
            q.pop();

            for (auto i : adj[top]) {
                indegree[i]--;

                if (indegree[i] == 0)
                    q.push(i);
            }
        }

        for (auto [key, deg] : indegree) {
            if (deg != 0)
                return false;
        }

        return true;
    }

public:
    bool isPrintable(vector<vector<int>>& grid) {
        unordered_set<int> nodes;
        int m = grid.size();
        int n = grid[0].size();

        for (auto i : grid) {
            for (auto j : i) {
                nodes.insert(j);
            }
        }

        unordered_map<int, tuple<int, int, int, int>> rect;

        for (int i : nodes) {
            int xmax = -1, xmin = 1e9, ymax = -1, ymin = 1e9;
            for (int x = 0; x < m; x++) {
                for (int y = 0; y < n; y++) {
                    if (grid[x][y] == i) {
                        xmax = max(xmax, x);
                        ymax = max(ymax, y);
                        xmin = min(xmin, x);
                        ymin = min(ymin, y);
                    }
                }
            }

            cout << i << "- " << xmax << " " << xmin << " " << ymax << " "
                 << ymin << endl;
            rect[i] = {xmax, xmin, ymax, ymin};
        }

        unordered_map<int, set<int>> adj;
        for (int it : nodes) {
            adj[it] = {};
        }

        for (int it : nodes) {
            auto [X, x, Y, y] = rect[it];
            for (int i = x; i <= X; i++) {
                for (int j = y; j <= Y; j++) {
                    if (grid[i][j] != it) {
                        adj[it].insert(grid[i][j]);
                    }
                }
            }
        }

        cout << endl;
        for (auto [key, vec] : adj) {
            cout << key << "- ";
            for (auto i : vec)
                cout << i << " ";
            cout << endl;
        }
        cout << endl;

        return cycle(adj);
    }
};
36455