<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:
    map<int,vector<int>>mp;
    bool findCycle(int node, vector<vector<int>>&adj,vector<int>&vis, vector<int>&pathVis){
        vis[node]=1;
        pathVis[node]=1;
        for(auto x:adj[node]){
            if(!vis[x]){
                if(findCycle(x,adj,vis,pathVis)){
                    return 1;
                }
            }
            else if(pathVis[x]){
                return 1;
            }
        }
        pathVis[node]=0;
        return 0;
    }
    bool isPrintable(vector<vector<int>>& t) {
        int n = t.size();
        int m = t[0].size();
        map<int,int>cnt;
        int sz=0;
        for(int i=0;i<n;i++){
            for(int j=0;j<m;j++){
                cnt[t[i][j]]=1;
                sz=max(sz,t[i][j]);
            }
        }
        for(auto x:cnt){
            int ele = x.first;
            int minrow = INT_MAX;
            int maxrow = INT_MIN;
            int mincol = INT_MAX;
            int maxcol = INT_MIN;
            for(int i=0;i<n;i++){
                for(int j=0;j<m;j++){
                    if(t[i][j]==ele){
                        minrow=min(i,minrow);
                        maxrow=max(i,maxrow);
                        mincol=min(j,mincol);
                        maxcol=max(j,maxcol);
                    }
                }
            }
            mp[ele]={minrow,mincol,maxrow,maxcol};
        }
        vector<vector<int>>edges;
        for(auto it:mp){
            int ele =it.first;
            int minrow = it.second[0];
            int maxrow = it.second[2];
            int mincol = it.second[1];
            int maxcol = it.second[3];
            cout<<ele<<" "<<minrow<<" "<<mincol<<" "<<maxrow<<" "<<maxcol<<endl;
            bool flag=false;
            set<int>st;
            set<int>::iterator itr;
            for(int i=minrow;i<=maxrow;i++){
                for(int j=mincol;j<=maxcol;j++){
                    if(t[i][j]!=ele){
                        st.insert(t[i][j]);
                    }
                }
            }
            for(itr=st.begin();itr!=st.end();itr++){
                edges.push_back({ele,*itr});
            }
        }
        vector<vector<int>>adj(sz+1);
        for(int i=0;i<edges.size();i++){
            int u = edges[i][0];
            int v = edges[i][1];
            adj[v].push_back(u);
        }
        vector<int>vis(sz+1,0);
        vector<int>pathVis(sz+1,0);
        for(int i=1;i<vis.size();i++){
            if(!vis[i]){
                if(findCycle(i,adj,vis,pathVis)){
                    return false;
                }
            }
        }
        return 1;
    }
};
35079