Submission #89508

#	Time	Username	Problem	Language	Result	Execution time	Memory
89508		Harvey_Rollens	Gift (IZhO18_nicegift)	C++14	0 / 100	2048 ms	116344 KiB

nicegift

#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define st string
#define fr first
#define se second

const ll mod=1e9+7;

using namespace std;

set<pair<ll, ll> > a;
vector<pair<ll, vector<ll> > > v;

int main()
{
    //freopen("1.txt", "r", stdin);
    //freopen("1.txt", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

    ll n, k;
    cin>>n>>k;

    for(ll i=1; i<=n; i++)
    {
        ll x;
        cin>>x;
        a.insert({x, i});
    }

    while(a.size()-k>=0)
    {

        std::vector<ll> q;

        if(v.size()*k>3000000)
        {
            cout<<-1;
            return 0;
        }

        std::vector<pair<ll, ll> > y;
        for(ll j=1; j<=k; j++)
        {
            std::pair<ll, ll> x;

            x=*a.rbegin();
            a.erase(x);

            q.push_back(x.se);
            x.fr--;

            if(x.fr)
                y.push_back(x);
        }
        for(ll i=0; i<y.size(); i++)
            a.insert(y[i]);

        v.push_back({1, q});
    }
    
    if(!a.empty())
    {
        cout<<-1;
        return 0;
    }

    cout<<v.size()<<endl;
    for(ll i=0; i<v.size(); i++)
    {
        cout<<v[i].fr<<" ";
        for(ll j=0; j<v[i].se.size(); j++)
        {
            cout<<v[i].se[j]<<" ";
        }
        cout<<endl;
    }
    return 0;
}
/*
*/

Compilation message (stderr)

nicegift.cpp: In function 'int main()':
nicegift.cpp:58:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(ll i=0; i<y.size(); i++)
                     ~^~~~~~~~~
nicegift.cpp:71:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(ll i=0; i<v.size(); i++)
                 ~^~~~~~~~~
nicegift.cpp:74:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(ll j=0; j<v[i].se.size(); j++)
                     ~^~~~~~~~~~~~~~~

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