# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1075179 | allin27x | Packing Biscuits (IOI20_biscuits) | C++17 | 1058 ms | 25784 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
unordered_map<int,int> memo;
vector<int> A;
int n,X;
int dp(int i, int add) {
int id = 130 * i + add;
if (memo.count(id)) return memo[id];
if (i==n-1) return memo[id] = add+1;
if (A[i] + add < X) return memo[id]=dp(i+1, (A[i]+add)/2);
return memo[id] = dp(i+1, (A[i]+add)/2) + dp(i+1, (A[i]+add-X)/2);
}
long long count_tastiness(long long x, std::vector<long long> a) {
a.resize(a.size()+65, 0);n = a.size(); X=x; memo.clear();
int extra = 0;
for (int i=0; i<a.size(); i++) {
extra/=2; a[i] += extra; extra = 0;
if (a[i] < x+2) continue;
if ((a[i]-x)&1) {
extra = a[i] - x - 1; a[i] = x+1;
} else {
extra = a[i] - x; a[i] = x;
}
}
A=a;
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... |