oj.uz

Submission #427413

# Submission time Handle Problem Language Result Execution time Memory
427413 2021-06-14T14:59:36 Z peijar Packing Biscuits (IOI20_biscuits) C++17
100 / 100
 119 ms 1304 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;

#include "biscuits.h"

const int MAX = 101;
int dfs(const vector<int> &a, int nbRestants, int x, int curBit) {
  if (curBit == MAX)
    return 1;
  if (curBit < (int)a.size())
    nbRestants += a[curBit];
  else if (nbRestants < x)
    return 1;
  int sol = dfs(a, nbRestants / 2, x, curBit + 1);
  if (nbRestants >= x)
    sol += dfs(a, (nbRestants - x) / 2, x, curBit + 1);
  return sol;
}

using ll = __int128;

map<ll, int> dp;

void write(ll x) {
  if (x >= 10)
    write(x / 10);
  cout << (int)(x % 10);
}

int solve(ll n, const vector<int> &a, int x, const vector<ll> &prefixSum) {
  if (n <= 0)
    return 0;
  if (n == 1)
    return 1;
  if (dp.count(n))
    return dp[n];
  ll curPow = 1;
  int i = 0;
  while (2 * curPow < n) {
    curPow *= 2;
    i++;
  }
  int &ret = dp[n];
  ret = solve(curPow, a, x, prefixSum);
  ret += solve(min(n, 1 + prefixSum[i] / x) - curPow, a, x, prefixSum);
  return ret;
}

int count_tastiness(int x, vector<int> a) {
  while (a.size() < MAX)
    a.push_back(0);
  dp.clear();

  vector<ll> prefixSum(MAX);
  ll curPow = 1;
  for (int i = 0; i < MAX; ++i) {
    prefixSum[i] = (i ? prefixSum[i - 1] : 0) + curPow * a[i];
    curPow *= 2;
  }
  // dp(n) = nb de sol < n
  // si 2^i <= n < 2^n+1, alors
  // dp(n) = dp[2^i] + dp[min(2^n, s[i]/x-2^i + 1)]
  return solve(curPow / 2, a, x, prefixSum);
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 2 ms 204 KB Output is correct
13 Correct 2 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 2 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 204 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 292 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 2 ms 332 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 2 ms 296 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 376 KB Output is correct
2 Correct 61 ms 828 KB Output is correct
3 Correct 59 ms 1220 KB Output is correct
4 Correct 45 ms 1196 KB Output is correct
5 Correct 62 ms 1192 KB Output is correct
6 Correct 72 ms 1148 KB Output is correct
7 Correct 54 ms 1100 KB Output is correct
8 Correct 51 ms 1148 KB Output is correct
9 Correct 52 ms 1156 KB Output is correct
10 Correct 43 ms 1100 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 2 ms 204 KB Output is correct
13 Correct 2 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 2 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 292 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 2 ms 332 KB Output is correct
35 Correct 2 ms 332 KB Output is correct
36 Correct 2 ms 296 KB Output is correct
37 Correct 26 ms 376 KB Output is correct
38 Correct 61 ms 828 KB Output is correct
39 Correct 59 ms 1220 KB Output is correct
40 Correct 45 ms 1196 KB Output is correct
41 Correct 62 ms 1192 KB Output is correct
42 Correct 72 ms 1148 KB Output is correct
43 Correct 54 ms 1100 KB Output is correct
44 Correct 51 ms 1148 KB Output is correct
45 Correct 52 ms 1156 KB Output is correct
46 Correct 43 ms 1100 KB Output is correct
47 Correct 33 ms 400 KB Output is correct
48 Correct 45 ms 1304 KB Output is correct
49 Correct 44 ms 400 KB Output is correct
50 Correct 44 ms 1180 KB Output is correct
51 Correct 33 ms 1228 KB Output is correct
52 Correct 28 ms 428 KB Output is correct
53 Correct 35 ms 1200 KB Output is correct
54 Correct 119 ms 1100 KB Output is correct
55 Correct 112 ms 1208 KB Output is correct
56 Correct 98 ms 1228 KB Output is correct
57 Correct 86 ms 1224 KB Output is correct