Submission #908573

#	Time	Username	Problem	Language	Result	Execution time	Memory
908573		GrindMachine	Gift (IZhO18_nicegift)	C++17	30 / 100	2111 ms	389304 KiB

nicegift

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

void solve(int test_case)
{
    ll n,k; cin >> n >> k;
    vector<ll> a(n+5);
    rep1(i,n) cin >> a[i];

    ll sum = 0;
    rep1(i,n) sum += a[i];

    if(sum%k){
        cout << -1 << endl;
        return;
    }

    ll mx = *max_element(all(a));
    if(mx > sum/k){
        cout << -1 << endl;
        return;
    }

    priority_queue<pll> pq;
    rep1(i,n) pq.push({a[i],i});

    vector<vector<ll>> ans;

    rep1(ops,sum/k){
        vector<ll> curr;

        rep1(iter,k){
            auto [val,i] = pq.top();
            pq.pop();
            curr.pb(i);
        }

        ans.pb(curr);

        trav(i,curr){
            a[i]--;
            pq.push({a[i],i});
        }
    }

    rep1(i,n){
        assert(a[i] == 0);
    }

    cout << sz(ans) << endl;
    trav(ar,ans){
        cout << 1 << " ";
        trav(i,ar){
            cout << i << " ";
        }
        cout << endl;
    }
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

• Subtask 1: 7 / 7
• Subtask 2: 11 / 11
• Subtask 3: 12 / 12
• Subtask 4: 0 / 19
• Subtask 5: 0 / 51