제출 #57407

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
57407		hugo_pm	Gift (IZhO18_nicegift)	C++14	30 / 100	880 ms	48120 KiB

nicegift

#include <bits/stdc++.h>
#pragma GCC diagnostic ignored "-Wunused-result"
using namespace std;
 
const int maxVerrous = 1000*1000;
int nbVerrous, tailleOperation;
int reqUnlock[maxVerrous];
int cur[maxVerrous];
priority_queue<pair<int, int>> prq;
 
int main()
{
    scanf("%d%d", &nbVerrous, &tailleOperation);
    for (int indVerrou = 0; indVerrou < nbVerrous; ++indVerrou) {
        scanf("%d", &reqUnlock[indVerrou]);
        prq.push({reqUnlock[indVerrou], indVerrou});
    }
 
    vector<vector<int>> operations;
    operations.reserve(100*1000);
    vector<int> curOp(tailleOperation);
 
    while (! prq.empty()) {
        int nbRestants = prq.size();
        if (nbRestants < tailleOperation) {
            printf("-1\n");
            return 0;
        }
        stack<pair<int, int>> remise;
        for (int indPris = 0; indPris < tailleOperation; ++indPris) {
            auto e = prq.top();
            prq.pop();
            curOp[indPris] = e.second;
            if (e.first > 1) {
                remise.push({e.first - 1, e.second});
            }
        }
        operations.push_back(curOp);
        while (! remise.empty()) {
            prq.push(remise.top());
            remise.pop();
        }
    }
 
    printf("%d\n", (int)(operations.size()));
    for (auto op : operations) {
        printf("1 ");
        for (int choisi : op) {
            printf("%d ", choisi+1);
        }
        printf("\n");
    }
 
    return 0;
}

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