제출 #1217688

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1217688		M_SH_O	Gift (IZhO18_nicegift)	C++20	0 / 100	2098 ms	55072 KiB

nicegift

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

#define ll long long
#define ll1 long long
#define ull unsigned long long
#define dou long double
#define str string
#define vll vector<ll>
#define vi vector<int>
#define pll pair<ll, ll>
#define vpll vector<pll>
#define vbool vector<bool>
#define vstr vector<str>
#define vvll vector<vll>
#define pb push_back
#define pf push_front
//#define endl "\n"
#define fr first
#define se second
// #define sortcmp(a) sort(a.begin(), a.end(), cmp)
#define sort(a) sort(a.begin(), a.end())
#define all(a) a.begin(), a.end()
#define reverse(a) reverse(a.begin(), a.end())
#define speed ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define INF 1000000000000000000
#define ordered_set tree<pll, null_type, less<pll>, rb_tree_tag, tree_order_statistics_node_update>

using namespace std;
//using namespace __gnu_pbds;

mt19937 rng(1488);
ll randll(ll l, ll r){
    return uniform_int_distribution<ll>(l, r)(rng);
}

vvll s1;
vll p;

ll find(ll v) {
    if (p[v] == v) return v;
    return p[v] = find(p[v]);
}

vll unite(ll a, ll b) {
    a = find(a);
    b = find(b);

    if (a == b) return {};
    if (s1[a].size() < s1[b].size()) {
        p[a] = b;
        for (auto i : s1[a]) {
            s1[b].pb(i);

        }
        return s1[a];
    }
    else {
        p[b] = a;
        for (auto i : s1[b]) {
            s1[a].pb(i);

        }
        return s1[b];
    }
}/*

vll tree1, d;

void push(ll v, ll tl, ll tr) {
    if (tl == tr) return;
    tree1[v*2] += d[v];
    tree1[v*2+1] += d[v];
    d[v*2] += d[v];
    d[v*2+1] += d[v];
    d[v] = 0;
    tree1[v] = tree1[v*2]+tree1[v*2+1];
}

void bt(ll v, ll tl, ll tr, vll& a) {
    if (tl == tr) {
        tree1[v] = a[tl];
        return;
    }

    ll tm = (tl+tr)/2;
    bt(v*2, tl, tm, a);
    bt(v*2, tm+1, tr, a);

    tree1[v] = tree1[v*2]+tree1[v*2+1];
}

ll get(ll l, ll r, ll v, ll tl, ll tr) {
    if (l <= tl && tr <= r) return tree1[v];
    if (tl > r || tr < l) return 0;

    ll tm = (tl+tr)/2;
    push(v, tl, tr);
    return get(l, r, v*2, tl, tm)+get(l, r, v*2+1, tm+1, tr);
}

void update(ll l, ll r, ll val, ll v, ll tl, ll tr) {
    if (l <= tl && tr <= r) {
        tree1[v] += val;
        d[v] += val;
        push(v, tl, tr);
        return;
    }
    if (tl > r || tr < l) return;

    ll tm = (tl+tr)/2;
    push(v, tl, tr);

    update(l, r, val, v*2, tl, tm);
    update(l, r, val, v*2+1, tm+1, tr);

    tree1[v] = tree1[v*2]+tree1[v*2+1];
}*/

int main(){
    ll n, k;
    cin >> n >> k;
    vll a(n);
    ll sm = 0;
    set<ll> s;
    for (int i =0 ; i < n; i ++) {
        cin >> a[i];
        s.insert(i);
        sm += a[i];
    }

    if (sm % k != 0) {
        cout << -1 << endl;
        return 0;
    }
    cout << sm/k << endl;
    if (sm > 1e5) while (1);

    for (int i = 0; i < sm/k; i ++) {
        vll v;
        for (int j : s) {
            v.pb(j);
            if (v.size() == k) break;
        }
        cout << "1 ";
        for (int j : v) {
            cout << j+1 << ' ';
            a[j] --;
            if (a[j] == 0) s.erase(j);
        }
        cout << endl;
    }

}

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