Submission #1112683

#	Time	Username	Problem	Language	Result	Execution time	Memory
1112683		dosts	Gift (IZhO18_nicegift)	C++17	100 / 100	1959 ms	118156 KiB

nicegift

//Dost SEFEROĞLU
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
#define ff first
#define ss second
#define sp << " " << 
#define vi vector<int>
#define all(xx) xx.begin(),xx.end()
#define ps(xxx) cout << (xxx) << endl;
const int N = 5e2+1,inf = 1e16,MOD = 1e9+7; 
 

void solve() { 
    int n,k;
    cin >> n >> k;
    int s = 0;
    set<pii,greater<pii>> ms;
    vi a(n+1);
    for (int i=1;i<=n;i++) {
        cin >> a[i];
        s+=a[i];
        ms.insert({a[i],i});
    }
    if (s%k != 0 || ms.rbegin()->ff > s/k) {
        cout << -1 << endl;
        return;
    } 
    vector<pair<int,vi>> ops;
    int sm = s/k;
    vi vv(k,0);
    while (!ms.empty()) {
        if (ms.size() == k) {
            if(ms.begin()->ff != ms.rbegin()->ff) {
                cout << -1 << endl;
                return;
            }
        }
        auto itt = ms.begin();
        int ctr = 0;
        for (;ctr != k;++itt) {
            vv[ctr] = (itt->ss);
            ctr++;
        }
        int knxt = next(ms.begin(),k-1)->ff;
        int subt = min(knxt,sm-((ms.size() > k) ? (next(ms.begin(),k)->ff) : 0ll));
        sm-=subt;
        for (auto it : vv) {
            ms.erase({a[it],it});
            if (a[it]-subt > 0) ms.insert({a[it]-subt,it});
            //else assert(a[it] == subt);
            a[it]-=subt;
        }
        ops.push_back({subt,vv});
    }
    cout << ops.size() << '\n';
    for (auto it : ops) {
        cout << it.ff << " ";
        for (auto itt : it.ss) cout << itt <<  " ";
        cout << '\n';
    }
}  
 
                
                            
signed main() { 
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    #ifdef Dodi
        freopen("in.txt","r",stdin);
        freopen("out.txt","w",stdout);
    #endif
    int t = 1;
    //cin >> t; 
    while (t --> 0) solve();
}

Compilation message (stderr)

nicegift.cpp: In function 'void solve()':
nicegift.cpp:36:23: warning: comparison of integer expressions of different signedness: 'std::set<std::pair<long long int, long long int>, std::greater<std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   36 |         if (ms.size() == k) {
      |             ~~~~~~~~~~^~~~
nicegift.cpp:49:44: warning: comparison of integer expressions of different signedness: 'std::set<std::pair<long long int, long long int>, std::greater<std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   49 |         int subt = min(knxt,sm-((ms.size() > k) ? (next(ms.begin(),k)->ff) : 0ll));
      |                                  ~~~~~~~~~~^~~

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