Submission #303372

# Submission time Handle Problem Language Result Execution time Memory
303372 2020-09-20T09:14:04 Z Elegia Packing Biscuits (IOI20_biscuits) C++17
42 / 100
1000 ms 41744 KB
#include "biscuits.h"

#include <functional>
#include <unordered_map>

using namespace std;

using ll = long long;

ll count_tastiness(ll x, vector<ll> a) {
	vector<unordered_map<ll, ll>> dp(61);
	a.resize(61);
	for (int i = 0; i < 60; ++i)
		if (a[i] >= x) {
			ll tak = (a[i] - x) / x / 2;
			a[i + 1] += tak * x;
			a[i] -= tak * 2 * x;
		}
	function<ll(int, ll)> dfs = [&](int k, ll v) {
		if (k == 60) return 1LL;
		if (dp[k].count(v))
			return dp[k][v];
		ll ret = dfs(k + 1, (v + a[k]) / 2);
		if (v + a[k] >= x) ret += dfs(k + 1, (v + a[k] - x) / 2);
		return dp[k][v] = ret;
	};
	return dfs(0, 0);
}

# 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 384 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 0 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 0 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 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 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 256 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 88 ms 15352 KB Output is correct
2 Correct 169 ms 8452 KB Output is correct
3 Correct 289 ms 13432 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 817 ms 15776 KB Output is correct
9 Correct 511 ms 11384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 10 ms 624 KB Output is correct
12 Correct 96 ms 2708 KB Output is correct
13 Correct 823 ms 16084 KB Output is correct
# Verdict Execution time Memory Grader output
1 Execution timed out 1049 ms 41744 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 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 384 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 0 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 0 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 384 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 0 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 256 KB Output is correct
22 Correct 1 ms 256 KB Output is correct
23 Correct 1 ms 256 KB Output is correct
24 Correct 88 ms 15352 KB Output is correct
25 Correct 169 ms 8452 KB Output is correct
26 Correct 289 ms 13432 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 817 ms 15776 KB Output is correct
32 Correct 511 ms 11384 KB Output is correct
33 Correct 2 ms 384 KB Output is correct
34 Correct 10 ms 624 KB Output is correct
35 Correct 96 ms 2708 KB Output is correct
36 Correct 823 ms 16084 KB Output is correct
37 Execution timed out 1049 ms 41744 KB Time limit exceeded
38 Halted 0 ms 0 KB -