Submission #305851

# Submission time Handle Problem Language Result Execution time Memory
305851 2020-09-24T02:55:44 Z ecnerwala Packing Biscuits (IOI20_biscuits) C++17
100 / 100
17 ms 896 KB
#include "biscuits.h"

#include <vector>
#include <iostream>
#include <cassert>

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; true; j--) {
			assert(cutoff >= 0);
			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;
			}
		}
	}
	return len.back();
}

// poss_carry = [0]
// for i in range(120):
//   poss_carry = [a[i] + v for v in poss_carry]
//   poss_carry = [v - x for v in poss_carry if v >= x] + poss_carry
//   poss_carry = [v / 2 for v in poss_carry]
//   assert max(poss_carry) - min(poss_carry) < x
//   mem[i+1] = poss_carry
// return len(poss_carry)

// We can move the threshold step to the end:
// poss_carry = [0]
// for i in range(120):
//   poss_carry = [v - x for v in poss_carry] + poss_carry
//   poss_carry = [a[i] + v for v in poss_carry]
//   poss_carry = [v / 2 for v in poss_carry]
//   poss_carry = [v for v in poss_carry if v >= 0]
//   assert max(poss_carry) - min(poss_carry) < x
//   mem[i+1] = poss_carry
// return len(poss_carry)
# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 12 ms 896 KB Output is correct
3 Correct 12 ms 896 KB Output is correct
4 Correct 13 ms 896 KB Output is correct
5 Correct 12 ms 896 KB Output is correct
6 Correct 17 ms 896 KB Output is correct
7 Correct 13 ms 896 KB Output is correct
8 Correct 11 ms 896 KB Output is correct
9 Correct 11 ms 896 KB Output is correct
10 Correct 11 ms 896 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 256 KB Output is correct
23 Correct 1 ms 256 KB Output is correct
24 Correct 1 ms 256 KB Output is correct
25 Correct 1 ms 256 KB Output is correct
26 Correct 0 ms 256 KB Output is correct
27 Correct 1 ms 256 KB Output is correct
28 Correct 1 ms 256 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 1 ms 256 KB Output is correct
31 Correct 1 ms 256 KB Output is correct
32 Correct 1 ms 256 KB Output is correct
33 Correct 1 ms 256 KB Output is correct
34 Correct 1 ms 256 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 1 ms 256 KB Output is correct
37 Correct 2 ms 384 KB Output is correct
38 Correct 12 ms 896 KB Output is correct
39 Correct 12 ms 896 KB Output is correct
40 Correct 13 ms 896 KB Output is correct
41 Correct 12 ms 896 KB Output is correct
42 Correct 17 ms 896 KB Output is correct
43 Correct 13 ms 896 KB Output is correct
44 Correct 11 ms 896 KB Output is correct
45 Correct 11 ms 896 KB Output is correct
46 Correct 11 ms 896 KB Output is correct
47 Correct 3 ms 384 KB Output is correct
48 Correct 14 ms 896 KB Output is correct
49 Correct 4 ms 384 KB Output is correct
50 Correct 12 ms 768 KB Output is correct
51 Correct 14 ms 896 KB Output is correct
52 Correct 2 ms 416 KB Output is correct
53 Correct 13 ms 800 KB Output is correct
54 Correct 13 ms 896 KB Output is correct
55 Correct 14 ms 896 KB Output is correct
56 Correct 13 ms 896 KB Output is correct
57 Correct 13 ms 896 KB Output is correct