Submission #305848

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
305848	2020-09-24 02:42:41	ecnerwala	Packing Biscuits (IOI20_biscuits)	C++17	100 / 100	15 ms	896 KiB

biscuits

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "biscuits.h"
#include <vector>
#include <iostream>
long long count_tastiness(long long X, std::vector<long long> A) {
  auto get_A = [&](int i) { return i < int(A.size()) ? A[i] : 0; };
  std::vector<long long> len(121);
  len[0] = 1;
  std::vector<long long> max_elt(121); // floor of the max element
  max_elt[0] = 0;
  for (int i = 0; i < 120; i++) {
    max_elt[i+1] = (get_A(i) + max_elt[i]) / 2;
    len[i+1] = 0;
    long long cutoff = 0;
    for (int j = i; j >= 0; j--) {
      cutoff *= 2;
      cutoff -= get_A(j);
      if (max_elt[j] >= cutoff + X) {
        len[i+1] += len[j];
        cutoff += X;
      }
      if (cutoff <= 0) {
        len[i+1] += len[j];
        break;
      }
      //cutoff = std::max(cutoff, 0ll);
    }
    //len[i+1]++; // the final 0
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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