# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1060406 | Jarif_Rahman | Gift (IZhO18_nicegift) | C++17 | 2048 ms | 511308 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k; cin >> n >> k;
vector<ll> A(n);
for(ll &x: A) cin >> x;
priority_queue<pair<ll, int>> pq;
for(int i = 0; i < n; i++) pq.push({A[i], i});
vector<pair<ll, vector<int>>> ans;
while(pq.size() >= k){
vector<int> cur;
for(int i = 0; i < k; i++) cur.push_back(pq.top().second), pq.pop();
ll lim = 0;
if(!pq.empty()) lim = pq.top().first-1;
ll mn = 1e18+5;
for(int x: cur) mn = min(mn, A[x]-lim);
for(int x: cur) A[x]-=mn;
ans.push_back({mn, cur});
for(int x: cur) if(A[x]) pq.push({A[x], x});
}
if(pq.size() != 0){
cout << "-1\n";
exit(0);
}
cout << ans.size() << "\n";
for(auto [x, v]: ans){
cout << x << " ";
for(int i: v) cout << i+1 << " ";
cout << "\n";
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |