# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
168483 | achibasadzishvili | Gift (IZhO18_nicegift) | C++14 | 0 ms | 0 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>
#define ll long long
#define f first
#define s second
#define pb push_back
#define mp make_pair
using namespace std;
ll n,k,a[2000005],s,las,p,cur,maxi,l,r,mid,can;
set<pair<ll,int> >st;
vector<vector<int> >ans;
vector<int>g;
int main(){
ios::sync_with_stdio(0);
cin>>n>>k;
bool ok = 1;
for(int i=1; i<=n; i++){
cin>>a[i];
if(a[i] != a[1])ok = 0;
s += a[i];
st.insert(mp(-a[i] , i));
}
if(s % k){
cout << "-1";
return 0;
}
ll raod = s / k;
ll sum = s;
ll ra = 0;
while(sum){
if((int)st.size() < k){
cout << "-1";
return 0;
}
p = 0,cur = 0;
g.clear();
maxi = -(*st.begin()).f;
for(set<pair<ll,int> >::iterator it = st.begin(); it != st.end(); it++){
p++;
if(p > k){
cur = (*it).s;
break;
}
las = (*it).s;
}
l = 1 , r = a[las] , mid , can = 1;
while(r >= l){
mid = (l + r) / 2;
if(max(maxi - mid , a[cur]) * k <= sum - mid * k){
l = mid + 1;
can = mid;
}
else {
r = mid - 1;
}
}
sum -= can * k;
ra += k;
p = 0;
g.pb(can);
for(set<pair<ll,int> >::iterator it = st.begin(); it != st.end(); it++){
p++;
if(p > k){
cur = (*it).s;
break;
}
g.pb((*it).s);
}
for(int i=1; i<g.size(); i++){
st.erase(mp(-a[g[i]] , g[i]));
a[g[i]]-=can;
if(a[g[i]])st.insert(mp(-a[g[i]] , g[i]));
}
ans.pb(g);
}
cout<<ans.size()<<"\n";
for(int i=0; i<ans.size(); i++){
for(int j=0; j<ans[i].size(); j++)cout<<ans[i][j]<<" ";
}
return 0;
}