<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 Rectangle{
public:
    pair<int,int> topLeft;// pair.first = row and pair.second = col
    pair<int,int> bottomRight;
    int val;

    
    #define tL topLeft
    #define bR bottomRight
    Rectangle(vector<vector<int>>& grid ,int x){
        topLeft.first = INT_MAX;
        topLeft.second = INT_MAX;
        bottomRight.first = INT_MIN;
        bottomRight.second = INT_MIN;
        val = x;
        int n = grid.size();
        int m = grid[0].size();
        tL.first = INT_MAX;
        for(int i = 0 ; i < n ;i++){
            for(int j = 0 ; j < m ; j++){
                if(grid[i][j] == val ){
                    tL.first = min(tL.first , i);
                    tL.second = min(tL.second , j);
                    bR.first = max(bR.first , i);
                    bR.second = max(bR.second , j);
                }
            }
        }
        
    }

    bool isComplete(vector<vector<int>>& grid){
        if(tL.first == INT_MAX)return true;
        for(int i = tL.first ; i <= bR.first ; i++){
            for(int j = tL.second ; j <= bR.second ; j++){
                if(grid[i][j] != val && grid[i][j] != 0){
                    return false;
                }
            }
        }
        
        for(int i = tL.first ; i <= bR.first ; i++){
            for(int j = tL.second ; j <= bR.second ; j++){
                grid[i][j] = 0;
            }
        }
        tL.first == INT_MAX;
        return true;
    }

    void print(){
        cout<<"Value = "<<val<<endl;
        cout<<"("<<tL.first<<","<<tL.second<<") ("<<bR.first<<","<<bR.second<<")"<<endl;
        cout<<endl;
    }
};

class Solution {
public:
    
    bool isPrintable(vector<vector<int>>& grid) {
        int n = grid.size();
        int m = grid[0].size();
        Rectangle* box[61];
        set<int> st;
        for(int i = 0 ;i < n ; i++){
            for(int j = 0 ;j < m ; j++){
                st.insert(grid[i][j]);
            }
        }
        for(int i = 1 ; i < 61 ; i++){
            if(st.count(i))
                box[i] = new Rectangle(grid , i);
        }
        for(int i = 1 ;i < 61 ;i++){
            for(int j = 1 ; j < 61 ; j++){
                if(st.count(j)){
                    if(box[j]->isComplete(grid))
                        st.erase(j);
                }
            }
        }
        // for(int i = 1 ; i < 60 ; i++){
        //     if(st.count(i))
        //         box[i]->print();
        // }
        // for(int i  = 0 ; i < n ; i++ ){
        //     for(int j = 0 ; j < m ; j++){
        //         cout<<grid[i][j]<<" ";
        //     }
        //     cout<<endl;
        // }
        for(int i  = 0 ; i < n ; i++ ){
            for(int j = 0 ; j < m ; j++){
                if(grid[i][j] != 0)return false;
            }
        }
        return true;
    }
};
17188