Sunday 1 February 2015

Codeforces Round #289, Painting Pebbles

Problem: Painting Pebbles

///     Raihan Ruhin
///     CSE, Jahangirnagar University.
///     Dhaka-Bangladesh.
///     id: raihanruhin (topcoder / codeforces / codechef / hackerrank), 3235 (lightoj)
///     mail: raihanruhin@ (yahoo / gmail / facebook)
///     blog: ruhinraihan.blogspot.com

#include<bits/stdc++.h>
using namespace std;

#define SET(a) memset(a,-1,sizeof(a))
#define CLR(a) memset(a,0,sizeof(a))
#define PI acos(-1.0)

#define MOD 1000000007
#define MX 100010


int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);
    int tc,kk=1, n, k, arr[105];
    cin>>n>>k;
    for(int i=0;i<n;i++) cin>>arr[i];
    vector<int>adj[105];
    for(int i=1;i<=k;i++)
    {
        int mn=105;
        for(int j=0;j<n;j++)
            mn=min(mn, arr[j]);
        for(int j=0;j<n;j++)
        {
            arr[j]-=mn;
            for(int jj=0;jj<mn;jj++)
                adj[j].push_back(i);
            if(arr[j])
            {
                adj[j].push_back(i);
                arr[j]--;
            }
        }
    }
    bool chk=true;
    for(int i=0;i<n;i++)
        if(arr[i]) chk=false;
    if(!chk) cout<<"NO\n";
    else
    {
        cout<<"YES\n";
        for(int i=0;i<n;i++)
        {
            for(int j=0;j<adj[i].size();j++)
            {
                if(j) cout<<" ";
                cout<<adj[i][j];
            }
            cout<<"\n";
        }
    }

    return 0;
}

No comments:

Post a Comment