Submission #767723

#	Time	Username	Problem	Language	Result	Execution time	Memory
767723		Trunkty	Gift (IZhO18_nicegift)	C++14	49 / 100	2025 ms	233512 KiB

nicegift

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll

int n,k,tot;
int arr[1000005];
map<int,vector<int>> vals;
multiset<int> s;
vector<vector<int>> ans;

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n >> k;
    for(int i=1;i<=n;i++){
        cin >> arr[i];
        s.insert(arr[i]);
        vals[arr[i]].push_back(i);
        tot += arr[i];
    }
    if(tot%k!=0 or tot/k<(*prev(s.end()))){
        cout << -1 << "\n";
        return 0;
    }
    int lef=tot/k;
    s.insert(0);
    while((*prev(s.end()))>0){
        vector<int> v;
        auto it = s.end();
        for(int i=1;i<=k;i++){
            it--;
            v.push_back((*it));
        }
        for(int i:v){
            s.erase(s.find(i));
        }
        int torem = min(v.back(),lef-(*prev(s.end())));
        lef -= torem;
        vector<int> ps={torem};
        reverse(v.begin(),v.end());
        for(int i:v){
            int x = vals[i].back();
            vals[i].pop_back();
            ps.push_back(x);
            vals[i-torem].push_back(x);
            s.insert(i-torem);
        }
        ans.push_back(ps);
    }
    cout << ans.size() << "\n";
    for(vector<int> i:ans){
        for(int j:i){
            cout << j << " ";
        }
        cout << "\n";
    }
    return 0;
}

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