Submission #306482

#	Time	Username	Problem	Language	Result	Execution time	Memory
306482		peti1234	Packing Biscuits (IOI20_biscuits)	C++17	100 / 100	17 ms	896 KiB

biscuits

#include<bits/stdc++.h>
using namespace std;
const int c=60;
long long dp[c+1], b[c+1], h, o=0, sum;
long long count_tastiness(long long x, vector<long long> a) {
    while(a.size()<c) a.push_back(0);
    b[0]=a[0], dp[0]=1;
    for (int i=1; i<c; i++) b[i]=b[i-1]/2+a[i];
    for (int i=1; i<=c; i++) {
        dp[i]=dp[i-1];
        if (b[i-1]>=x) {
            h=max(o, x-a[i-1])*2, sum=0;
            for (int j=i-2; j>=0; j--) {
                if (b[j]>=x+h) sum+=dp[j], h=max(o, h+x-a[j])*2;
                else h=max(o, h-a[j])*2;
            }
            if (!h) sum++;
            dp[i]+=sum;
        }
    }
    return dp[c];
}

• Subtask 1: 9 / 9
• Subtask 2: 12 / 12
• Subtask 3: 21 / 21
• Subtask 4: 35 / 35
• Subtask 5: 23 / 23