| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 306028 | eriksuenderhauf | Packing Biscuits (IOI20_biscuits) | C++17 | 1095 ms | 41772 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 "biscuits.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define sz(x) (int)(x).size()
unordered_map<ll,ll> dp[65];
void dfs(int d, ll p, ll& ret, ll x, vector<ll>& a) {
if (d > 60 || (d >= sz(a) && p == 0))
return;
p = p / 2 + (d < sz(a) ? a[d] : 0);
if (dp[d].count(p)) {
ret += dp[d][p];
return;
}
ll t = ret;
dfs(d + 1, p, ret, x, a);
if (p >= x) {
ret++;
dfs(d + 1, p - x, ret, x, a);
}
dp[d][p] = ret - t;
}
ll count_tastiness(ll x, vector<ll> a) {
int k = sz(a);
for (int i = 0; i <= 60; i++)
dp[i].clear();
ll ret = 1;
dfs(0, 0, ret, x, a);
return ret;
}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... | ||||
