430A - Points and Segments (easy) - CodeForces Solution

//
// Created by Xiuyuan Cao on 2023/2/22.
//


#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <queue>
#include <limits>
using namespace std;

typedef long long ll;

ll mod=1e9+7;


bool check(vector<int>& segment,vector<int>& res,vector<vector<int>>& points){
    int countRed=0;
    int countBlue=0;
    for(int i=0;i<points.size();i++){
        if(points[i][0]>=segment[0]&&points[i][0]<=segment[1]){
            if(res[points[i][1]]==1){
                countBlue++;
            }
            else{
                countRed++;
            }
        }
    }
    return abs(countBlue-countRed)<=1;
}

void solve(){
    int n,m;
    cin>>n;
    cin>>m;
    vector<vector<int>> points(n);
    for(int i=0;i<n;i++){
        int x;
        cin>>x;
        points[i]={x,i};
    }
    auto cmp=[](vector<int> p1,vector<int> p2){return p1[0]<p2[0];};
    sort(points.begin(),points.end(),cmp);
    vector<vector<int>> segments(m);
    for(int i=0;i<m;i++){
        int l,r;
        cin>>l;
        cin>>r;
        segments[i]={l,r};
    }
    vector<int> res(n);
    for(int i=0;i<n;i++){
        res[points[i][1]]=(1-i%2);
    }
    for(vector<int> segment:segments){
        if(check(segment,res,points)==false){
            cout<<-1<<endl;
            return;
        }
    }
    for(int i:res){
        cout<<i<<" ";
    }
}


int main(){
    solve();
}