# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
335212 | amunduzbaev | Gift (IZhO18_nicegift) | C++14 | 213 ms | 55148 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;
#define ff first
#define ss second
#define ll long long
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define prc(n) fixed << setprecision(n)
#define fastios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pi acos(-1);
const ll inf = 1e18+7;
const int N = 1e6+5;
vector<pll>v[N];
vector<ll>ans[N];
ll a[N];
ll n, k, mx, sum;
main(){
scanf("%lld %lld", &n, &k);
for(int i=0; i<n; i++){
scanf("%lld", &a[i]);
mx = max(a[i], mx);
sum += a[i];
}
if(mx * k > sum || sum % k >= 0){
cout<<mx<<" "<<sum<<" "<<-1;
return 0;
}
ll c = 0, cnt = 0;
ll size = sum / k;
for (int i = 0; i < n; i++) {
if(c + a[i] >= size){
ll x = c + a[i] - size;
v[cnt++].pb({a[i] - x, i + 1});
c = a[i] - (a[i] + x);
v[cnt].pb({c, i + 1});
} else{
c += a[i];
v[cnt].pb({a[i], i + 1});
}
}
bool f = 1;
cnt = 0;
while(f){
f = 0;
ll mn = inf;
for(int i = 0; i < k; i++) mn = min(mn, v[i].back().ff);
ans[cnt].pb(mn);
for(int i = 0; i < k; i++){
pll x = v[i].back();
v[i].pop_back();
x.ff -= mn;
ans[cnt].pb(x.ss);
if(x.ff > 0) v[i].pb(x);
}
f |= !v[0].empty();
cnt++;
}
printf("%lld\n", cnt);
for(int i = 0; i < cnt; i++){
for(int j = 0; j < sz(ans[i]); j++){
printf("%lld ", ans[i][j]);
}printf("\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... |