codeforces 430 A Points and Segments (easy)

 1 #include<iostream>  
 2 #include<cstdio>  
 3 #include<cstring> 
 4 #include <cmath> 
 5 #include<stack>
 6 #include<vector>
 7 #include<map> 
 8 #include<set>
 9 #include<queue> 
10 #include<algorithm>  
11 using namespace std;
12 
13 typedef long long LL;
14 const int INF = (1<<30)-1;
15 const int mod=1000000007;
16 const int maxn=1005;
17 
18 struct node{
19     int x,y,z;
20 } a[maxn];
21 
22 int cmp(node n1,node n2){
23     if(n1.x!=n2.x) return n1.x<n2.x;
24     return n1.y<n2.y;
25 }
26 
27 int main(){
28     int n,m;
29     scanf("%d %d",&n,&m);
30     for(int i=1;i<=n;i++){
31         scanf("%d",&a[i].x);
32         a[i].y=i;
33         a[i].z=0;
34     }
35     
36     sort(a+1,a+n+1,cmp);
37     
38     while(m--){
39         int u,v;
40         cin>>u>>v;
41     }
42     
43     for(int i=1;i<=n;i++){
44         if(i%2) a[a[i].y].z=1;
45         else a[a[i].y].z=0;
46     }
47     
48     for(int i=1;i<=n;i++)
49     printf("%d ",a[i].z);
50     return 0;
51 }