codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

430A.md (2069B)


      1 Source: https://codeforces.com/problemset/problem/430/A
      2 
      3 A. Points and Segments (easy)
      4 
      5 time limit per test
      6 
      7 1 second
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 stdin
     16 
     17 output
     18 
     19 stdout
     20 
     21 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.
     22 
     23 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.
     24 
     25 Iahub thinks that point *x* belongs to segment [*l*, *r*], if inequality *l* ≤ *x* ≤ *r* holds.
     26 
     27 Iahub gives to you all coordinates of points and segments. Please, help him to find any good drawing.
     28 
     29 Input
     30 
     31 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*1, *x*2, ..., *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.
     32 
     33 It's guaranteed that all the points are distinct.
     34 
     35 Output
     36 
     37 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).
     38 
     39 If there are multiple good drawings you can output any of them.
     40 
     41 Examples
     42 
     43 Input
     44 
     45 ```
     46 3 3  
     47 3 7 14  
     48 1 5  
     49 6 10  
     50 11 15
     51 ```
     52 
     53 Output
     54 
     55 ```
     56 0 0 0
     57 ```
     58 
     59 Input
     60 
     61 ```
     62 3 4  
     63 1 2 3  
     64 1 2  
     65 2 3  
     66 5 6  
     67 2 2
     68 ```
     69 
     70 Output
     71 
     72 ```
     73 1 0 1
     74 ```