专栏首页奇妙的算法世界codeforces 509B(构造,思维)

codeforces 509B(构造,思维)

题意描述

There are n piles of pebbles on the table, the i-th pile contains a i pebbles. Your task is to paint each pebble using one of the k given 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 i and number of pebbles of color c in pile j is at most one.

In other words, let’s say that b i, 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 |b i, c - b j, c| ≤ 1. It isn’t necessary to use all k colors: if color c hasn’t been used in pile i, then b i, c is considered to be zero.

给每一组的石头染色,要求任意两组颜色的数量差不能超过1.

思路

观察样例可以发现,如果每个数和最小的数的差值大于k的话是无解的。对于有解的情况,我们可以先输出min个1,然后再依次输出1,2,3,…,n即可

AC代码

#include<bits/stdc++.h>
#define x first
#define y second
#define PB push_back
#define mst(x,a) memset(x,a,sizeof(x))
#define all(a) begin(a),end(a)
#define rep(x,l,u) for(ll x=l;x<u;x++)
#define rrep(x,l,u) for(ll x=l;x>=u;x--)
#define IOS ios::sync_with_stdio(false);cin.tie(0);
using namespace std;
typedef unsigned long long ull;
typedef pair<int,int> PII;
typedef pair<long,long> PLL;
typedef pair<char,char> PCC;
typedef long long ll;
const int N=1e5+10;
const int M=1e6+10;
const int INF=0x3f3f3f3f;
const int MOD=1e9+7;
int a[N];
void solve(){
    int n,k;cin>>n>>k;
    int MIN=INF;
    rep(i,1,n+1){
        cin>>a[i];
        MIN=min(MIN,a[i]);
    }
    int flag=0;
    rep(i,1,n+1){
        if(a[i]-MIN>k) flag=1;
    }
    if(flag) cout<<"NO"<<endl;
    else{
        cout<<"YES"<<endl;
        rep(i,1,n+1){
            rep(j,1,MIN+1) cout<<1<<' ';
            rep(j,1,a[i]-MIN+1) cout<<j<<' ';
            cout<<endl;
        }
    }
}
int main(){
    IOS;
    solve();
    return 0;
}

本文参与腾讯云自媒体分享计划,欢迎正在阅读的你也加入,一起分享。

我来说两句

0 条评论
登录 后参与评论

相关文章

  • codeforces 1384A(构造)

    The length of the longest common prefix of two strings s=s1s2…sn and t=t1t2…tm i...

    dejavu1zz
  • codeforces 628B(数学)

    Max wants to buy a new skateboard. He has calculated the amount of money that is...

    dejavu1zz
  • codeforces 1324E(dp)

    dejavu1zz
  • Code Forces 21C Stripe 2

    C. Stripe 2 time limit per test 1 second memory limit per test 64 megabyte...

    ShenduCC
  • codeforces 1384A(构造)

    The length of the longest common prefix of two strings s=s1s2…sn and t=t1t2…tm i...

    dejavu1zz
  • codeforces 628B(数学)

    Max wants to buy a new skateboard. He has calculated the amount of money that is...

    dejavu1zz
  • c/c++基础零散补充

    一、C语言的指针与数组、结构体里的成员数组和指针、传入传出参数、回调函数、头文件包含 指针的本质都只是一个内存地址,如果是多字节变量,则是其内存首地址(低地址...

    s1mba
  • PAT 1018 Public Bike Management(Dijkstra 最短路)

    1018. Public Bike Management (30) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 16...

    ShenduCC
  • HDU 1017 A Mathematical Curiosity【水,坑】

    A Mathematical Curiosity Time Limit: 2000/1000 MS (Java/Others)    Memory Limit:...

    Angel_Kitty
  • PCIE AER

    PCI Express error signaling can occur on the PCI Express link itself or on behal...

    PedroQin

扫码关注云+社区

领取腾讯云代金券