Codeforces Round #245 (Div. 2) A - Points and Segments (easy)

最新推荐文章于 2019-08-23 21:57:46 发布

旻宇

最新推荐文章于 2019-08-23 21:57:46 发布

阅读量864

点赞数

分类专栏：杂题文章标签： codeforces 杂题水题

本文链接：https://blog.csdn.net/u010129448/article/details/25719383

版权

杂题专栏收录该内容

9 篇文章 0 订阅

订阅专栏

原题链接： http://codeforces.com/contest/430/problem/A

无力吐槽的水题，尽管原题上标明了easy，但我还是不敢相信会有这么水的题！当一个题简单到你不都敢相信它会那么简单的时候，它就变难了……

A. Points and Segments (easy)

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 [l_i, r_i] consider all the red points belong to it (r_i points), and all the blue points belong to it (b_i points); each segment i should satisfy the inequality |r_i - b_i| ≤ 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 integers x₁, x₂, ..., x_n (0 ≤ x_i ≤ 100) — the coordinates of the points. The following m lines contain the descriptions of the m segments. Each line contains two integers l_i and r_i (0 ≤ l_i ≤ r_i ≤ 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

Output

0 0 0

Input

Output

1 0 1

#include <cstdio>
#include <algorithm>
struct point{
   int coo;
   int num;
}p[110];

bool cmp(point x, point y){
    return  x.coo < y.coo;
}

int main(){
    int n, m, l, r, ans[110];
    scanf("%d %d ", &n, &m);
    for(int i = 0; i < n; i ++){
        scanf("%d", &p[i].coo);
        p[i].num = i;
    }
   while(m--) { scanf("%d %d", &l, &r); }  
   std::sort(p, p + n, cmp);
   for(int i = 0; i < n; i++)
        ans[p[i].num] = i%2==0 ? 1 : 0;
   for(int i = 0; i < n-1; i++)
         printf("%d ", ans[i]);
   printf("%d\n", ans[n-1]);
   return 0;
}