Submission #535821

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
535821	2022-03-11T11:10:25 Z	KoD	Packing Biscuits (IOI20_biscuits)	C++17	100 / 100	214 ms	1356 KB

biscuits

#include <bits/stdc++.h>
#include "biscuits.h"

using ll = long long;

using std::vector;
using std::array;
using std::pair;

ll count_tastiness(ll x, vector<ll> a) {
	a.resize(60);
	array<ll, 60> max;
	ll sum = 0;
	for (int i = 0; i < 60; ++i) {
		sum += a[i] << i;
		max[i] = sum / x;
	}
	std::map<pair<int, ll>, ll> memo;
	auto dfs = [&](auto&& self, int d, ll y) -> ll {
		y = std::min(y, (1ll << (d + 1)) - 1);
		if (d == -1) {
			return 0;
		}
		if (const auto itr = memo.find(pair(d, y)); itr != memo.end()) {
			return itr->second;
		}
		const ll ub = std::min(max[d], y) - (1ll << d);
		if (ub >= 0) {
			ll ret = 1;
			for (int k = 0; k < d; ++k) {
				ret += self(self, k, ub);
			}
			return memo[{d, y}] = ret;
		} else {
			return memo[{d, y}] = 0;
		}
	};
	ll ret = 1;
	for (int k = 0; k < 60; ++k) {
		ret += dfs(dfs, k, 1ll << 60);
	}
	return ret;
}

Subtask #1

9.0 / 9.0

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

Subtask #2

12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	312 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	300 KB	Output is correct

Subtask #3

21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	224 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	304 KB	Output is correct
8	Correct	1 ms	308 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	2 ms	212 KB	Output is correct
11	Correct	3 ms	340 KB	Output is correct
12	Correct	4 ms	340 KB	Output is correct
13	Correct	3 ms	340 KB	Output is correct

Subtask #4

35.0 / 35.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	9 ms	340 KB	Output is correct
2	Correct	66 ms	1196 KB	Output is correct
3	Correct	66 ms	1196 KB	Output is correct
4	Correct	65 ms	1108 KB	Output is correct
5	Correct	60 ms	1108 KB	Output is correct
6	Correct	53 ms	1136 KB	Output is correct
7	Correct	54 ms	1108 KB	Output is correct
8	Correct	52 ms	1148 KB	Output is correct
9	Correct	54 ms	1156 KB	Output is correct
10	Correct	52 ms	1164 KB	Output is correct

Subtask #5

23.0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	312 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	1 ms	300 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	1 ms	224 KB	Output is correct
27	Correct	1 ms	212 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	1 ms	304 KB	Output is correct
31	Correct	1 ms	308 KB	Output is correct
32	Correct	1 ms	212 KB	Output is correct
33	Correct	2 ms	212 KB	Output is correct
34	Correct	3 ms	340 KB	Output is correct
35	Correct	4 ms	340 KB	Output is correct
36	Correct	3 ms	340 KB	Output is correct
37	Correct	9 ms	340 KB	Output is correct
38	Correct	66 ms	1196 KB	Output is correct
39	Correct	66 ms	1196 KB	Output is correct
40	Correct	65 ms	1108 KB	Output is correct
41	Correct	60 ms	1108 KB	Output is correct
42	Correct	53 ms	1136 KB	Output is correct
43	Correct	54 ms	1108 KB	Output is correct
44	Correct	52 ms	1148 KB	Output is correct
45	Correct	54 ms	1156 KB	Output is correct
46	Correct	52 ms	1164 KB	Output is correct
47	Correct	15 ms	340 KB	Output is correct
48	Correct	56 ms	1356 KB	Output is correct
49	Correct	35 ms	384 KB	Output is correct
50	Correct	50 ms	1176 KB	Output is correct
51	Correct	12 ms	1312 KB	Output is correct
52	Correct	6 ms	340 KB	Output is correct
53	Correct	12 ms	1084 KB	Output is correct
54	Correct	214 ms	1220 KB	Output is correct
55	Correct	194 ms	1108 KB	Output is correct
56	Correct	166 ms	1104 KB	Output is correct
57	Correct	129 ms	1236 KB	Output is correct