Submission #893225

#	Time	Username	Problem	Language	Result	Execution time	Memory
893225		vjudge1	Gift (IZhO18_nicegift)	C++17	7 / 100	399 ms	71016 KiB

nicegift

// 以上帝的名义
// 候选硕士
#include <bits/stdc++.h>

#ifdef local
#include "algo/debug.h"
#else
#define dbg(x...) 0
#endif

using namespace std ;
using ll = long long ;

int32_t main() {
    cin.tie(0)->sync_with_stdio(false) ;
    int n , k ; cin >> n >> k ;
    vector<ll> a(n) ;
    for (ll &i : a) cin >> i ;
    priority_queue<pair<ll,ll>> q ;
    for (int i = 0 ; i < n ; i++) {
        q.push({a[i], i}) ;
    }
    set<ll> st(a.begin(), a.end()) ;
    ll sum = accumulate(a.begin(), a.end(), 0ll) ;
    if (sum % k || (sum / k) < q.top().first) {
        cout << -1 << "\n" ;
        return 0 ;
    }
    vector<vector<int>> res ;
    while (q.size() >= k) {
        vector<int> cur ;
        for (int i = 0 ; i < k ; i++) {
            auto [value, ind] = q.top() ;
            q.pop() ;
            cur.push_back(ind) ;
        }
        sort(cur.begin(), cur.end(), [&](int i, int j) {
            return a[i] < a[j] ;
        }) ;
        ll mn = a[cur[0]] ;
        if (q.size()) mn = min(mn * 1ll, (sum / k) - q.top().first) ;
        for (int i : cur) {
            a[i] -= mn ;
            if (a[i]> 0) {
                q.push({a[i], i}) ;
            }
        }
        cur.push_back(mn) ;
        res.push_back(cur) ;
    }
    if (q.size()) {
        cout << -1 << "\n" ;
        return 0 ;
    }
    cout << res.size() << "\n" ;
    for (auto i : res) {
        cout << i.back() << ' ' ; i.pop_back() ;
        for (int j : i) cout << j + 1 << ' ' ;
        cout << "\n" ;
    }
    return 0 ;
}

// 希望白银

Compilation message (stderr)

nicegift.cpp: In function 'int32_t main()':
nicegift.cpp:30:21: warning: comparison of integer expressions of different signedness: 'std::priority_queue<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   30 |     while (q.size() >= k) {
      |            ~~~~~~~~~^~~~

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