| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 412388 | achibasadzishvili | Packing Biscuits (IOI20_biscuits) | C++17 | 9 ms | 304 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 "biscuits.h"
#include<bits/stdc++.h>
#define ll long long
#define f first
#define s second
#define pb push_back
using namespace std;
ll pre[505],n;
map<ll,pair<ll,ll> >got;
ll solve(ll k){
	if(k <= 0)return 0;
	if(got[k].f)return got[k].s;
	ll ret = 0;
	ll pw = 1,t = 0;
	while(2 * pw < k){
		t++;
		pw *= 2;
	}
	ret = solve(pw) + solve(min(k ,1 + pre[t] / n) - pw);
	got[k] = {1 , ret};
	//cout << k << " " << ret << '\n';
	return ret;
}
ll count_tastiness(ll x, vector<ll> a){
	got.clear();
	for(int i=0; i<a.size(); i++){
		if(!i)pre[i] = a[i] * (1LL << i);
		else pre[i] = pre[i - 1] + a[i] * (1LL << i);
	}
	n = x;
	got[1] = {1 , 1};
	return solve(1e18);
}
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... | ||||
