# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
303393 | qiangbao | Packing Biscuits (IOI20_biscuits) | C++14 | 2 ms | 384 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 <iostream>
#include <vector>
#include "biscuits.h"
using namespace std;
typedef long long ll;
ll ways[64];
ll pow2[64];
void ini()
{
ll i;
pow2[0]=1;
for(i=1;i<=63;i++)
pow2[i]=pow2[i-1]*2;
for(i=0;i<=63;i++)
ways[i]=0;
ways[0]=1;
}
ll count_tastiness(ll x, vector<ll> a)
{
ll tot=0;
ll i, j;
ini();
for(i=0;i<a.size();i++){
ll way=0;
tot+=a[i]*pow2[i];
ll tot2=tot;
for(j=i;j>=0;j--)
if(tot2>=x*pow2[j])
tot2-=x*pow2[j], way+=ways[j];
ways[i+1]=way+1;
}
return ways[a.size()];
}
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... |