<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 isPrintable(vector<vector<int>>& v) {
        int n = v.size();
        int m = v[0].size();
        vector<int> cnt(61, 0);
        set<int>s;
        vector<vector<int>> pos(61,{100,100,0,0});
        unordered_map<int,set<pair<int,int>>>mp;
        for (int i=0;i<n;i++) {
            for (int j=0;j<m;j++) {
                pos[v[i][j]][0]=min(pos[v[i][j]][0],i);
                pos[v[i][j]][1]=min(pos[v[i][j]][1],j);
                pos[v[i][j]][2]=max(pos[v[i][j]][2],i);
                pos[v[i][j]][3]=max(pos[v[i][j]][3],j);
                mp[v[i][j]].insert({i,j});
                s.insert({v[i][j]});
            }
        }
        for(int i=0;i<=60;i++){
            cnt[i]=(pos[i][2]-pos[i][0]+1)*(pos[i][3]-pos[i][1]+1);
        }
        vector<int>vis(61,0);
        queue<int>q;
        for(int i=0;i<=60;i++){
            if(cnt[i]==mp[i].size()){
                vis[i]=1;
                q.push(i);
            }
        }
        while(!q.empty()){
            int a=q.front();
            q.pop();
            cout<<a<<endl;
            s.erase(a);
            // cout<<pos[a][0]<<" "<<pos[a][2]<<" "<<pos[a][1]<<" "<<pos[a][3]<<endl;
            for(int i=pos[a][0];i<=pos[a][2];i++){
                for(int j=pos[a][1];j<=pos[a][3];j++){
                     for(int k=0;k<=60;k++){
                        //  if(mp.find(k)==mp.end())
                        // if(cnt[k]==9801)continue;
                          if(i<=pos[k][2] && i>=pos[k][0] && j<=pos[k][3] && j>=pos[k][1]){
                            mp[k].insert({i,j});
                          }
                          if(mp[k].size()==cnt[k] && !vis[k]){
                            q.push(k);
                            vis[k]=1;
                          }
                     }
                }
            }
        }
       return s.size()==0;
    }
};
34620