Submission #391415

# Submission time Handle Problem Language Result Execution time Memory
391415 2021-04-18T17:24:48 Z AlexPop28 Packing Biscuits (IOI20_biscuits) C++14
12 / 100
1000 ms 144060 KB
#include "biscuits.h"
#include <bits/stdc++.h>

using namespace std;

int n;

map<pair<int, long long>, long long> memo;
long long Solve(int i, const vector<long long> &cnt, long long s) {
  if (memo.count({i, s})) return memo[{i, s}];
  if (i == (int)cnt.size()) {
    return 1 + s / n;
  }

  long long ret;
  ret = Solve(i + 1, cnt, (s + cnt[i]) / 2);
  if (s + cnt[i] >= n) {
    ret += Solve(i + 1, cnt, (s + cnt[i] - n) / 2);
  }
  return memo[{i, s}] = ret; 
}

long long count_tastiness(long long n, vector<long long> a) {
  ::n = n;
  long long s = 0;
  for (int i = 0; i < (int)a.size(); ++i) {
    if (a[i] > n + 1) {
      if (i + 1 == (int)a.size()) a.emplace_back(0LL);
      auto delta = (a[i] - n) / 2;
      a[i + 1] += delta;
      a[i] -= 2 * delta;
    }
    s += a[i] << i;
    // cerr << a[i] << ' ';
  }
  // cerr << endl;
  memo.clear();
  return Solve(0, a, 0);
}

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Execution timed out 1097 ms 144060 KB Time limit exceeded
3 Halted 0 ms 0 KB -
# 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 208 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
# Verdict Execution time Memory Grader output
1 Correct 247 ms 20676 KB Output is correct
2 Correct 566 ms 10532 KB Output is correct
3 Correct 990 ms 17204 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 332 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Execution timed out 1090 ms 22528 KB Time limit exceeded
9 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 1087 ms 16764 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Execution timed out 1097 ms 144060 KB Time limit exceeded
3 Halted 0 ms 0 KB -