# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1073809 | allin27x | Packing Biscuits (IOI20_biscuits) | C++17 | 3 ms | 348 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 <bits/stdc++.h>
using namespace std;
#include "biscuits.h"
#define int long long
long long count_tastiness(long long x, std::vector<long long> a) {
int ans = 0;
a.resize(a.size()+65, 0);
int extra = 0;
for (int i=0; i<a.size(); i++) {
extra/=2; a[i] += extra;
if (a[i]&1) {
extra += a[i] - 1; a[i] = 1;
} else {
if (!a[i]) continue;
extra += a[i] - 2; a[i] = 2;
}
}
int n = a.size();
vector dp(n, vector<int> {0,0}); dp[n-1][0]=1; dp[n-1][1] = 2;
for (int i=n-2; i>=0; i--) {
if (!a[i]) {
dp[i][0] = dp[i+1][0];
dp[i][1] = 2*dp[i][0];
}
if (a[i]==1) {
dp[i][0] = 2*dp[i+1][0];
dp[i][1] = 2*dp[i+1][0] + dp[i+1][1];
}
if (a[i]==2) {
dp[i][0] = 2*dp[i+1][0] + dp[i+1][1];
dp[i][1] = 2*dp[i+1][0] + 2*dp[i+1][1];
}
}
return dp[0][0];
}
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... |