Submission #1239482

#TimeUsernameProblemLanguageResultExecution timeMemory
1239482_callmelucianGift (IZhO18_nicegift)C++17
0 / 100
2109 ms140140 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; using pl = pair<ll,ll>; using pii = pair<int,int>; using tpl = tuple<int,int,int>; #define all(a) a.begin(), a.end() #define filter(a) a.erase(unique(all(a)), a.end()) int main() { ios::sync_with_stdio(0); cin.tie(0); int n, k; cin >> n >> k; vector<ll> a(n); for (ll &u : a) cin >> u; ll sum = accumulate(all(a), 0LL); if (sum % k) return cout << -1 << "\n", 0; priority_queue<pii> pq; for (int i = 0; i < n; i++) pq.emplace(a[i], i); cout << sum / k << "\n"; for (int i = 0; i < sum / k; i++) { cout << 1 << " "; for (int j = 0; j < k; j++) { int a, idx; tie(a, idx) = pq.top(); pq.pop(); cout << idx + 1 << " "; if (a > 1) pq.emplace(a - 1, idx); } cout << "\n"; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...