Submission #357943

#TimeUsernameProblemLanguageResultExecution timeMemory
357943juggernautPacking Biscuits (IOI20_biscuits)C++14
0 / 100
1 ms492 KiB
#include"biscuits.h"
#include<bits/stdc++.h>
#ifndef EVAL
#include"grader.cpp"
#endif
using namespace std;
typedef long long ll;
ll count_tastiness(ll x,vector<ll>a){
    int k=a.size();
    ll ans=1;
    for(int i=k-1;i>0;i--)
        if(a[i-1]){
            a[i-1]+=a[i]<<1ll;
            a[i]=0;
            ans*=a[i]+1;
        }
    ans*=a[0]+1;
    return ans;
}

#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...