# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
823900 | drdilyor | Packing Biscuits (IOI20_biscuits) | C++17 | 1 ms | 596 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>
#include "biscuits.h"
using namespace std;
using ll = long long;
const int T = 120;
long long count_tastiness(long long x, std::vector<long long> a) {
assert(x == 1);
int k = a.size();
a.resize(T+1);
ll cur = 0;
for (int i = 0; i <= T; i++) {
if (a[i] > 1) {
ll d = (a[i] - 1) / 2;
a[i] -= d;
a[i+1] += d;
}
}
// for (ll i : a) cout << i << ' '; cout << endl;
vector<array<ll, 2>> ans(T+2);
ans[0] = {1, 0};
for (int i = 0; i <= T; i++) {
if (a[i]) {
ans[i+1][0] = ans[i][0] + ans[i][1];
ans[i+1][1] = ans[i][0] + ans[i][1];
} else {
ans[i+1][0] = ans[i][0] + ans[i][1];
ans[i+1][1] = 0;
for (int j = i-1; j >= 0; j--) {
if (a[j] == 0) break;
if (a[j] == 2) {
ans[i+1][1] += ans[j + 1][0];
}
}
}
}
// for (ll i : ans) cout << i << ' '; cout << endl;
return ans[T+1][0] + ans[T+1][1];
}
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... |