제출 #844068

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
844068		GrandTiger1729	Gift (IZhO18_nicegift)	C++17	30 / 100	329 ms	66828 KiB

nicegift

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

int main()
{
    cin.tie(0)->sync_with_stdio(0);
    int n, K; cin >> n >> K;
    vector<int> a(n);
    for (int i = 0; i < n; i++)
        cin >> a[i];
    priority_queue<pair<int, int>> pq;
    for (int i = 0; i < n; i++)
        pq.emplace(a[i], i);
    vector<vector<int>> ans;
    while (pq.size())
    {
        vector<pair<int, int>> res;
        for (int i = 0; i < K; i++)
        {
            if (pq.empty())
            {
                cout << -1 << '\n';
                return 0;
            }
            auto x = pq.top();
            pq.pop();
            x.first--;
            res.push_back(x);
        }
        ans.emplace_back();
        for (int i = 0; i < K; i++)
        {
            ans.back().push_back(res[i].second);
            if (res[i].first > 0)
                pq.push(res[i]);
        }
    }
    cout << ans.size() << '\n';
    for (auto &vec : ans)
    {
        cout << 1 << ' ';
        for (int j = 0; j < K; j++)
            cout << vec[j] + 1 << " \n"[j == K - 1];
    }
    return 0;
}

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