C. Division and Union

https://codeforc.es/contest/1101/problem/C

题意：q个询问，每个n个区间，将区间分成两部分；两部分不能有相交的区间；

思路：排序选与第一块相连的给1就行，不能全部判断否则会tle；

#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
#include<string>
#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-16
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

const int maxn=1e6+9;
const int mod=1e9+7;

inline ll read()
{
    ll f=1,x=0;
    char ss=getchar();
    while(ss<'0'||ss>'9')
    {
        if(ss=='-')f=-1;ss=getchar();
    }
    while(ss>='0'&&ss<='9')
    {
        x=x*10+ss-'0';ss=getchar();
    }    return f*x;
}

ll power(ll x,ll n)
{
    ll ans=1;
    while(n)
    {
        if(n&1) ans=ans*x;
        x=x*x;
        n>>=1;
    }
    return ans;
}

struct node
{
    int id;
    int l,r;
    bool operator<(node &b)
    {
        if(l==b.l) return r<b.r;
        return l<b.l;
    }
}a[maxn];
int n;
bool ans[maxn];
int main()
{
    //FAST_IO;
    //freopen("input.txt","r",stdin);

    int t;
    cin>>t;
    while(t--)
    {
        cin>>n;
        for(int i=1;i<=n;i++)
        {
            cin>>a[i].l>>a[i].r;
            a[i].id=i;
            ans[i]=0;
        }
        sort(a+1,a+n+1);
        bool f=0;
        int now=a[1].r;
        ans[a[1].id]=1;
        for(int i=2;i<=n;i++)
        {
            if(a[i].l<=now)
            {
                ans[a[i].id]=1;
            }
            else
            {
                f=1;
                break;
            }
            now=max(now,a[i].r);
        }
        if(!f)
        {
            cout<<-1<<endl;
        }
        else
        {
            for(int i=1;i<=n;i++)
            {
                if(ans[i])
                    cout<<1<<" ";
                else cout<<2<<" ";
            }
            cout<<endl;
        }
    }
	return 0;
}