codeforces 239D Boring Partition

题目

D. Boring Partition

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

This problem is the most boring one you've ever seen.

Given a sequence of integers a1, a2, ..., an and a non-negative integer h, our goal is to partition the sequence into two subsequences (not necessarily consist of continuous elements). Each element of the original sequence should be contained in exactly one of the result subsequences. Note, that one of the result subsequences can be empty.

Let's define function f(ai, aj) on pairs of distinct elements (that is i ≠ j) in the original sequence. If ai and aj are in the same subsequence in the current partition then f(ai, aj) = ai + aj otherwise f(ai, aj) = ai + aj + h.

Consider all possible values of the function f for some partition. We'll call the goodness of this partiotion the difference between the maximum value of function f and the minimum value of function f.

Your task is to find a partition of the given sequence a that have the minimal possible goodness among all possible partitions.

Input

The first line of input contains integers n and h (2 ≤ n ≤ 105, 0 ≤ h ≤ 108). In the second line there is a list of n space-separated integers representing a1, a2, ..., an (0 ≤ ai ≤ 108).

Output

The first line of output should contain the required minimum goodness.

The second line describes the optimal partition. You should print n whitespace-separated integers in the second line. The i-th integer is 1 if ai is in the first subsequence otherwise it should be 2.

If there are several possible correct answers you are allowed to print any of them.

Examples

input

Copy

3 2
1 2 3

output

Copy

1
1 2 2 

input

Copy

5 10
0 1 0 2 1

output

Copy

3
2 2 2 2 2 

Note

In the first sample the values of f are as follows: f(1, 2) = 1 + 2 + 2 = 5, f(1, 3) = 1 + 3 + 2 = 6 and f(2, 3) = 2 + 3 = 5. So the difference between maximum and minimum values of f is 1.

In the second sample the value of h is large, so it's better for one of the sub-sequences to be empty.

题意有一组数需要我们将其分成两个组，f(x1,x2),表示如x1,x2在同一组就只是单纯的相加，不在同一组就加起来再加个h。

问如何分组才能让函数的最大值和最小值差值最小。

通过样例和题意很容易发现它只有两种情况一种是h过大不加h将他们都分在一组的情况另一种是让最小值尽可能的小把最小值单独分在一组这样就能尽可能地让最小值变大。如果全分成一组的话最小值肯定是第一小加上第二小然而分成两组之后就可以在第一小和第二小之间加上一个h就能让他变大而且(这时候第二小和第三小也有可能是最小值)但不论怎样他都使最小值变大。

到时候我们只需要比较一下是全分到一组小还是但拿出一个来最小就可以了。

#include<string.h>
#include<cmath>
#include<iostream>
#include<cstdio>
#include<algorithm>
#define ll long long
using namespace std;
int main()
{
    int n,k,a[100000],b[100000],c[100000];
    cin>>n>>k;
    int sum=0;
    for(int i=1; i<=n; i++)
    {
        cin>>b[i];
        c[i]=b[i];
    }
    sort(b+1,b+1+n);
    int maxx=max(b[n]+b[n-1],b[1]+b[n]+k),minn=min(b[1]+b[2]+k,b[2]+b[3]);
    if(b[n]+b[n-1]-b[2]-b[1]<maxx-minn)
    {
        cout<<b[n]+b[n-1]-b[2]-b[1]<<endl;
        for(int i=1;i<=n;i++)
        {
            cout<<2<<' ';
        }
        cout<<endl;
    }
    else
    {
        int flag=1;
        cout<<maxx-minn<<endl;
        for(int i=1;i<=n;i++)
        {
            if(c[i]==b[1]&&flag)
            {
                flag=0;
                cout<<1<<' ';
            }
            else
                cout<<2<<' ';
        }
        cout<<endl;
    }
}