# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
171142 | juggernaut | Gift (IZhO18_nicegift) | C++14 | 2041 ms | 196728 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.
//Just try and the idea will come!
#include<bits/stdc++.h>
#define int long long int
using namespace std;
priority_queue<pair<int,int>>q;
int n,k,i,x;
pair<int,int>a[100000];
vector<vector<int>>ans;
main(){
scanf("%lld%lld",&n,&k);
for(i=0;i<n;i++){
scanf("%lld",&x);
q.push({x,i+1});
}
while(!q.empty()){
if(q.size()<k){
puts("-1");
return 0;
}
vector<int>res;
for(i=0;i<k;i++)a[i]=q.top(),q.pop();
for(i=0;i<k;i++){
res.push_back(a[i].second);
if(a[i].first!=1)q.push({a[i].first-1,a[i].second});
}
ans.push_back(res);
}
printf("%lld\n",(int)ans.size());
for(auto res:ans){
printf("1 ");
for(int to:res)printf("%lld ",to);
puts("");
}
}
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... |