| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 319242 | neki | Packing Biscuits (IOI20_biscuits) | 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>
#include "biscuits.h"
#define loop(i, a, b) for(long long i=a;i<b;i++)
#define pool(i, a, b) for(long long i=a-1;i>=b;i--)
#define fore(i, a) for(auto&& i:a)
#define fi first
#define se second
#define ps(a) push_back(a)
#define pb(a) pop_back(a)
#define sc scanf
#define vc vector
#define pa pair<ll, ll>
#define ll long long
#define lb lower_bound
#define ub upper_bound
#define all(a) a.begin(), a.end()
#define llmax LLONG_MAX/2
#define llmin -LLONG_MAX/2
using namespace std;
#define mn 1010
#define pa pair<ll, ll>
#define ld long double
ll n, a[100];
ll solve(ll x, ll ind){
//cout << ind << " "<<a[ind]<<endl;
if(ind==n-1) return a[ind]/x + 1;
a[ind+1]+=a[ind]/2;
ll ret=solve(x, ind+1);
a[ind+1]-=a[ind]/2;
if(a[ind]>=x){
a[ind+1]+=(a[ind]-x)/2;
ret+=solve(x, ind+1);
a[ind+1]-=(a[ind]-x)/2;
}
return ret;
}