제출 #57401

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
57401		hugo_pm	Gift (IZhO18_nicegift)	C++14	0 / 100	2085 ms	525312 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];
vector<pair<int, int>> tab;

int main()
{
    scanf("%d%d", &nbVerrous, &tailleOperation);
    tab.resize(nbVerrous);
    for (int indVerrou = 0; indVerrou < nbVerrous; ++indVerrou) {
        scanf("%d", &reqUnlock[indVerrou]);
        tab[indVerrou] = {reqUnlock[indVerrou], indVerrou};
    }

    sort(tab.begin(), tab.end());
    reverse(tab.begin(), tab.end());
    vector<vector<int>> operations;
    operations.reserve(100*1000);
    vector<int> curOp(tailleOperation);

    while (! tab.empty()) {
        while ((! tab.empty()) && cur[tab.back().second] == reqUnlock[tab.back().second]) {
            tab.pop_back();
        }
        if (tab.empty()) {
            break;
        }
        int nbRestants = tab.size();
        if (nbRestants < tailleOperation) {
            printf("-1\n");
            return 0;
        }
        for (int indPris = 0; indPris < tailleOperation; ++indPris) {
            curOp[indPris] = tab[nbRestants - indPris - 1].second;
            ++cur[curOp[indPris]];
        }
        operations.push_back(curOp);
    }

    printf("%d\n", (int)(operations.size()));
    for (auto op : operations) {
        printf("1 ");
        for (int choisi : op) {
            printf("%d ", choisi);
        }
        printf("\n");
    }

    return 0;
}

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