oj.uz

Submission #421511

# Submission time Handle Problem Language Result Execution time Memory
421511 2021-06-09T08:34:49 Z KoD Packing Biscuits (IOI20_biscuits) C++17
100 / 100
 136 ms 1336 KB 
#include <bits/extc++.h>
#include "biscuits.h"

namespace {

using ll = long long;
template <class T> using Vec = std::vector<T>;
template <class T, class U> using HashTable = __gnu_pbds::gp_hash_table<T, U>;

template <class F> struct RecLambda: private F {
	explicit RecLambda(F&& f): F(std::forward<F>(f)) {}
	template <class... Args> decltype(auto) operator() (Args&&... args) const {
		return F::operator()(*this, std::forward<Args>(args)...);
	}	
};

}

ll count_tastiness(ll x, Vec<ll> a) {
	a.resize(60);
	std::array<ll, 60> sum{};
	for (int i = 0; i < 60; ++i) {
		sum[i] = (i == 0 ? 0 : sum[i - 1]) + (a[i] << i);
	}
	HashTable<ll, ll> table;
	table[1] = 1;
	return RecLambda([&](auto&& dfs, const ll n) -> ll {
		if (n <= 0)  {
			return 0;
		}
		if (table[n] != 0) {
			return table[n];
		}
		int logn = 0;
		while (((ll) 1 << (logn + 1)) < n) {
			logn += 1;
		}
		return table[n] = dfs((ll) 1 << logn) + dfs(std::min(sum[logn] / x + 1, n) - ((ll) 1 << logn));
	})((ll) 1 << 60);
}

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 1 ms 204 KB Output is correct
13 Correct 1 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 4 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

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 288 KB Output is correct
3 Correct 1 ms 288 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 2 ms 292 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 296 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 3 ms 332 KB Output is correct
13 Correct 3 ms 332 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 452 KB Output is correct
2 Correct 55 ms 820 KB Output is correct
3 Correct 57 ms 1192 KB Output is correct
4 Correct 44 ms 1192 KB Output is correct
5 Correct 44 ms 1176 KB Output is correct
6 Correct 54 ms 1100 KB Output is correct
7 Correct 76 ms 1076 KB Output is correct
8 Correct 50 ms 1140 KB Output is correct
9 Correct 47 ms 1160 KB Output is correct
10 Correct 39 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 1 ms 204 KB Output is correct
13 Correct 1 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 4 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 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 288 KB Output is correct
26 Correct 1 ms 288 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 2 ms 292 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 296 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 3 ms 332 KB Output is correct
36 Correct 3 ms 332 KB Output is correct
37 Correct 24 ms 452 KB Output is correct
38 Correct 55 ms 820 KB Output is correct
39 Correct 57 ms 1192 KB Output is correct
40 Correct 44 ms 1192 KB Output is correct
41 Correct 44 ms 1176 KB Output is correct
42 Correct 54 ms 1100 KB Output is correct
43 Correct 76 ms 1076 KB Output is correct
44 Correct 50 ms 1140 KB Output is correct
45 Correct 47 ms 1160 KB Output is correct
46 Correct 39 ms 1100 KB Output is correct
47 Correct 30 ms 332 KB Output is correct
48 Correct 44 ms 1320 KB Output is correct
49 Correct 33 ms 392 KB Output is correct
50 Correct 45 ms 1156 KB Output is correct
51 Correct 31 ms 1336 KB Output is correct
52 Correct 17 ms 412 KB Output is correct
53 Correct 22 ms 1192 KB Output is correct
54 Correct 127 ms 1184 KB Output is correct
55 Correct 136 ms 1204 KB Output is correct
56 Correct 109 ms 1228 KB Output is correct
57 Correct 100 ms 1228 KB Output is correct