Submission #790700

#TimeUsernameProblemLanguageResultExecution timeMemory
790700Trisanu_DasPacking Biscuits (IOI20_biscuits)C++17
100 / 100
13 ms1332 KiB
#include <bits/stdc++.h>
#include "biscuits.h"
 
using namespace std;
using ll = long long;
 
const int MX = 62;
 
ll count_tastiness(ll x, vector<ll> a) {
	vector<ll> D(MX, 1);
	a.resize(MX);
	for (int i=1; i<MX; i++) {
		a[i]=(a[i]<<i)+a[i-1];
		ll n=(1e18);
		for (int j=i-1; j>=0; j--) {
			n=min(n, a[j]);
			if (x<=(n>>j)) D[i]+=D[j], n-=(x<<j);
		}
	}
	return D.back();
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...