Codeforces 430 A. Points and Segments (easy)

A. Points and Segments (easy)

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Iahub isn't well prepared on geometry problems, but he heard that this year there will be a lot of geometry problems on the IOI selection camp. Scared, Iahub locked himself in the basement and started thinking of new problems of this kind. One of them is the following.

Iahub wants to draw n distinct points and m segments on the OX axis. He can draw each point with either red or blue. The drawing is good if and only if the following requirement is met: for each segment [li, ri] consider all the red points belong to it (ri points), and all the blue points belong to it (bi points); each segment i should satisfy the inequality |ri - bi| ≤ 1.

Iahub thinks that point x belongs to segment [l, r], if inequality l ≤ x ≤ r holds.

Iahub gives to you all coordinates of points and segments. Please, help him to find any good drawing.

Input

The first line of input contains two integers: n (1 ≤ n ≤ 100) and m (1 ≤ m ≤ 100). The next line contains n space-separated integersx1, x2, ..., xn (0 ≤ xi ≤ 100) — the coordinates of the points. The following m lines contain the descriptions of the m segments. Each line contains two integers li and ri (0 ≤ li ≤ ri ≤ 100) — the borders of the i-th segment.

It's guaranteed that all the points are distinct.

Output

If there is no good drawing for a given test, output a single integer -1. Otherwise output n integers, each integer must be 0 or 1. The i-th number denotes the color of the i-th point (0 is red, and 1 is blue).

If there are multiple good drawings you can output any of them.

Sample test(s)

input

3 3
3 7 14
1 5
6 10
11 15

output

0 0 0

input

3 4
1 2 3
1 2
2 3
5 6
2 2

output

1 0 1 

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

int n,m;
struct POINT
{
    int x,c,id;
}point[110];

bool cmp1(POINT a,POINT b)
{
    return a.x<b.x;
}

bool cmp2(POINT a,POINT b)
{
    return a.id<b.id;
}

int main()
{
    scanf("%d%d",&n,&m);
    for(int i=0;i<n;i++)
    {
        scanf("%d",&point[i].x);
        point[i].id=i;
    }
    for(int i=0;i<m;i++) scanf("%*d%*d");
    sort(point,point+n,cmp1);
    for(int i=0;i<n;i++)
    {
        point[i].c=i%2;
    }
    sort(point,point+n,cmp2);
    for(int i=0;i<n;i++)
    {
        printf("%d ",point[i].c);
    }
    putchar(10);
    return 0;
}