# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
168460 | achibasadzishvili | Gift (IZhO18_nicegift) | C++14 | 68 ms | 20060 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 int
#define f first
#define s second
#define pb push_back
#define mp make_pair
using namespace std;
ll n,k,a[200005],s;
set<pair<ll,ll> >st;
vector<vector<ll> >ans;
vector<ll>g;
int main(){
ios::sync_with_stdio(false);
cin >> n >> k;
for(int i=1; i<=n; i++){
cin >> a[i];
s += a[i];
st.insert(mp(-a[i] , i));
}
if(s % k){
cout << "-1";
return 0;
}
ll raod = s / k;
while(raod--){
if((int)st.size() < k){
cout << "-1";
return 0;
}
ll p = 0;
g.clear();
for(set<pair<ll,ll> >::iterator it = st.begin(); it != st.end(); it++){
p++;
if(p > k)break;
g.pb((*it).s);
}
for(int i=0; i<g.size(); i++){
st.erase(mp(-a[g[i]] , g[i]));
a[g[i]]--;
if(a[g[i]])st.insert(mp(-a[g[i]] , g[i]));
}
ans.pb(g);
}
cout << (int)ans.size() << endl;
for(int i=0; i<ans.size(); i++){
cout << 1 << " ";
for(int j=0; j<ans[i].size(); j++)
cout << ans[i][j] << " ";
cout << '\n';
}
return 0;
}
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... |