Submission #520855

#TimeUsernameProblemLanguageResultExecution timeMemory
520855jamezzzPacking Biscuits (IOI20_biscuits)C++17
33 / 100
16 ms5312 KiB
#include "biscuits.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; ll dp[65][100005]; ll count_tastiness(ll x,vector<ll> a){ int k=a.size(); for(int i=0;i<k-1;++i){ ll c=max(0ll,a[i]-x)/2; a[i]-=2*c;a[i+1]+=c; } for(int i=k-1;i>=0;--i){ for(ll c=x;c>=0;--c){ ll cur=c+a[i]; if(i==k-1)dp[i][c]=cur/x+1; else{ dp[i][c]=dp[i+1][cur/2]; if(cur>=x)dp[i][c]+=dp[i+1][(cur-x)/2]; } } } return dp[0][0]; }
#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...