Submission #306022

#	Time	Username	Problem	Language	Result	Execution time	Memory
306022		eriksuenderhauf	Packing Biscuits (IOI20_biscuits)	C++17	0 / 100	69 ms	21136 KiB

biscuits

#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)
    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);
  vector<vector<int>> dp(k+1, vector<int>(k+1, 0));
  for (int i = 0; i <= 60; i++)
    dp[i].clear();
  ll ret = 1;
  dfs(0, 0, ret, x, a);
  return ret;
}

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