Codefroecs 289 div2 B. Painting Pebbles（贪心）

B. Painting Pebbles

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

There are n piles of pebbles on the table, the i-th pile contains ai pebbles. Your task is to paint each pebble using one of the kgiven colors so that for each color c and any two piles i and j the difference between the number of pebbles of color c in pile iand number of pebbles of color c in pile j is at most one.

In other words, let's say that bi, c is the number of pebbles of color c in the i-th pile. Then for any 1 ≤ c ≤ k, 1 ≤ i, j ≤ n the following condition must be satisfied |bi, c - bj, c| ≤ 1. It isn't necessary to use all k colors: if color c hasn't been used in pile i, then bi, c is considered to be zero.

Input

The first line of the input contains positive integers n and k (1 ≤ n, k ≤ 100), separated by a space — the number of piles and the number of colors respectively.

The second line contains n positive integers a1, a2, ..., an (1 ≤ ai ≤ 100) denoting number of pebbles in each of the piles.

Output

If there is no way to paint the pebbles satisfying the given condition, output "NO" (without quotes) .

Otherwise in the first line output "YES" (without quotes). Then n lines should follow, the i-th of them should contain ai space-separated integers. j-th (1 ≤ j ≤ ai) of these integers should be equal to the color of the j-th pebble in the i-th pile. If there are several possible answers, you may output any of them.

Sample test(s)

input

4 4
1 2 3 4

output

YES
1
1 4
1 2 4
1 2 3 4

input

5 2
3 2 4 1 3

output

NO

input

5 4
3 2 4 3 5

output

YES
1 2 3
1 3
1 2 3 4
1 3 4
1 1 2 3 4

解题思路：

这题读了好一会，左右颠倒总算理解了，就是说，有ｎ堆物品，每堆物品ａ［ｉ］个，然后用ｋ种颜色给这ｎ堆物品中的每个物品染色，保证任意两堆的物品中每个物品所染的相同颜色的次数不能超过１，就拿第一个样例来说吧。ｎ＝４，ｋ＝４，ａ［１］＝１，ａ［２］＝２，ａ［３］＝３，

ａ［４］＝４，输出的结果是，第一堆的一个物品染成颜色１，第二堆的两个物品分别染成颜色１,４，第三堆的三个物品分别染成颜色１,２,４.第四堆的四个物品分别染成颜色１，２,３,４。注意：不要把颜色的编号和物品的编号搞混了。

现在来分析下样例吧，颜色１在４堆物品中都用到了１次，所以说，任意两堆的差值都是０，颜色２在第三堆和第四堆被用到了，其他堆都是０,所以说任意两堆的差值也是不超过１的。依次往下分析颜色３，颜色４就好。。。。。

所以呢，首先应该找到的是这堆物品中的最小值和最大值，如果最大值－最小值＞ｋ的话，那么我们就直接输出ＮＯ。（很简单了，认真画画就出来了）

如果满足条件的话，先出个ＹＥＳ，然后每次第一个物品都用１染，再用、、、

代码：

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

using namespace std;

int a1[105];

int main(void)
{
    int n,k;
    int p;
    cin>>n>>k;
    for( int i = 0;i < n;i++ )
    {
        cin>>a1[i];
    }

   int _min = a1[0];
   int _max = a1[0];
   for ( int i = 0;i < n;i++ )
   {
       if ( a1[i] < _min )
       {
           _min = a1[i];
       }
       if ( a1[i] > _max )
       {
           _max = a1[i];
       }
   }

    if( _max-_min > k )
    {
        printf("NO\n");
    }
    else{
        printf("YES\n");
        for( int i = 0;i < n;i++ )
        {
            printf("1");
            for( int j = 2;j <= a1[i];j++ )
            {
                p = j;
                while( p > k )
                p = p - k;
                printf(" %d",p);
            }
            printf("\n");
        }
    }
    return 0;
}