oj.uz

Submission #392326

# Submission time Handle Problem Language Result Execution time Memory
392326 2021-04-20T19:32:36 Z johutha Packing Biscuits (IOI20_biscuits) C++17
100 / 100
 19 ms 1332 KB 
#include "biscuits.h"
#include <iostream>

#define int long long
#define lint __int128

using namespace std;

int count_tastiness(int x, vector<int> a)
{
	const int m = 64;

	vector<int> pref_dp(m);
	vector<int> dp(m);
	vector<lint> avs(m);

	dp[0] = 1;
	a.resize(m);

	avs[0] = 0;
	lint pw = 1;
	for (int i = 0; i < m - 1; i++, pw *= 2)
	{
		avs[i + 1] = avs[i] + pw * (lint)a[i];
	}
	// cerr << 0 << " " << dp[0] << "\n";

	pw = 1;
	for (int i = 1; i < m; i++, pw *= 2)
	{
		pref_dp[i] = dp[i - 1] + pref_dp[i - 1];
		if (avs[i] < pw*x) continue;

		lint b = avs[i] - pw*x;
		lint np = pw / 2;

		// cerr << "Starting " << i << " with " << avs[i] << ", after subtracting " << b << "\n";

		for (int j = i - 1; j >= 0; j--, np /= 2)
		{
			b = min(b, avs[j]);
			// cerr << " -> " << j << " " << b << " " << np << "\n";
			if (b >= np * x)
			{
				dp[i] += pref_dp[j];
				b -= np*x;
			}
		}
		if (b >= 0) dp[i]++;
		// cerr << i << " " << dp[i] << "\n";
	}
	return dp[m - 1] + pref_dp[m - 1];
}

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 292 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 288 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 204 KB Output is correct
3 Correct 1 ms 296 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 308 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 288 KB Output is correct
13 Correct 1 ms 204 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 332 KB Output is correct
2 Correct 14 ms 1100 KB Output is correct
3 Correct 14 ms 1192 KB Output is correct
4 Correct 14 ms 1196 KB Output is correct
5 Correct 14 ms 1148 KB Output is correct
6 Correct 12 ms 1152 KB Output is correct
7 Correct 12 ms 1088 KB Output is correct
8 Correct 12 ms 1076 KB Output is correct
9 Correct 12 ms 1096 KB Output is correct
10 Correct 12 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 292 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 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 288 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 296 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 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 308 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 288 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 3 ms 332 KB Output is correct
38 Correct 14 ms 1100 KB Output is correct
39 Correct 14 ms 1192 KB Output is correct
40 Correct 14 ms 1196 KB Output is correct
41 Correct 14 ms 1148 KB Output is correct
42 Correct 12 ms 1152 KB Output is correct
43 Correct 12 ms 1088 KB Output is correct
44 Correct 12 ms 1076 KB Output is correct
45 Correct 12 ms 1096 KB Output is correct
46 Correct 12 ms 1100 KB Output is correct
47 Correct 4 ms 332 KB Output is correct
48 Correct 19 ms 1332 KB Output is correct
49 Correct 7 ms 384 KB Output is correct
50 Correct 16 ms 1100 KB Output is correct
51 Correct 12 ms 1272 KB Output is correct
52 Correct 2 ms 332 KB Output is correct
53 Correct 10 ms 1100 KB Output is correct
54 Correct 16 ms 1100 KB Output is correct
55 Correct 16 ms 1104 KB Output is correct
56 Correct 15 ms 1100 KB Output is correct
57 Correct 14 ms 1100 KB Output is correct