<p>We want to split a group of <code>n</code> people (labeled from <code>1</code> to <code>n</code>) into two groups of <strong>any size</strong>. Each person may dislike some other people, and they should not go into the same group.</p>

<p>Given the integer <code>n</code> and the array <code>dislikes</code> where <code>dislikes[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that the person labeled <code>a<sub>i</sub></code> does not like the person labeled <code>b<sub>i</sub></code>, return <code>true</code> <em>if it is possible to split everyone into two groups in this way</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> n = 4, dislikes = [[1,2],[1,3],[2,4]]
<strong>Output:</strong> true
<strong>Explanation:</strong> The first group has [1,4], and the second group has [2,3].
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> n = 3, dislikes = [[1,2],[1,3],[2,3]]
<strong>Output:</strong> false
<strong>Explanation:</strong> We need at least 3 groups to divide them. We cannot put them in two groups.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= n &lt;= 2000</code></li>
	<li><code>0 &lt;= dislikes.length &lt;= 10<sup>4</sup></code></li>
	<li><code>dislikes[i].length == 2</code></li>
	<li><code>1 &lt;= a<sub>i</sub> &lt; b<sub>i</sub> &lt;= n</code></li>
	<li>All the pairs of <code>dislikes</code> are <strong>unique</strong>.</li>
</ul>

class Solution {
public:
    bool possibleBipartition(int n, vector<vector<int>>& dislikes) {
        if(n == 1)return true;
        vector<int> adj[n + 1], vis(n + 1, 0);
        bool flag = true;
        map<int, int> color;
        for(auto it : dislikes){
            adj[it[0]].push_back(it[1]);
            adj[it[1]].push_back(it[0]);
        }
        for(int j = 1; j <= n; j++){
            if(vis[j])continue;
            queue<pair<int, int>> q;
            q.push({j, 0});
            color[j] = 0;
            vis[j] = 1;
            while(!q.empty()){
                int node = q.front().first;
                int cl = q.front().second;
                q.pop();
                for(auto it : adj[node]){
                    if(!vis[it]){
                        vis[it] = 1;
                        color[it] = !cl;
                        q.push({it, color[it]});
                    }
                    else{
                        if(color[it] == cl)flag = false;
                    }
                }
            }
        }
        for(int j = 0; j < n; j++){
            cout << color[j] << " ";
        }
        return flag;
    }
};
77996