oj.uz

Submission #303297

# Submission time Handle Problem Language Result Execution time Memory
303297 2020-09-20T07:30:15 Z jtnydv25 Packing Biscuits (IOI20_biscuits) C++17
100 / 100
 430 ms 1016 KB 
#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;

#define ll long long

ll count_tastiness(ll x, vector<ll> a) {
	int k = 60;
	a.resize(k);
	ll val = 0;
	vector<ll> prefixes(60);
	for(int i = 0; i < k; i++){
		val += a[i] << i;
		// (prefix[i] + 2^i) * x <= val
		ll maxVal = val / x - (1LL << i) + 1;
		
		if(maxVal >= (1LL << i)) prefixes[i] = 1LL << i;
		else{
			prefixes[i] = max(0LL, maxVal);
		}
	}
	map<ll, ll> dp;
	dp[1] = 1;
	for(int i = 1; i <= k; i++){
		map<ll, ll> cp_dp = dp;
		dp.clear();
		// dp[z] = # possible with the value of smallest i bits <= z
		for(auto it : prefixes){
			ll v = it & ((1LL << i) - 1);
			if(v >> (i - 1) & 1){
				ll t = v ^ (1LL << (i - 1));
				dp[v] = cp_dp[1LL << (i-1)]; // ALL
				dp[v] += cp_dp[min(t, prefixes[i - 1])];
			}
			else dp[v] = cp_dp[v];
		}
		dp[1LL << i] = cp_dp[1LL << (i - 1)] + cp_dp[prefixes[i - 1]];
	}
	return dp[1LL << k];
	
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 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 2 ms 256 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 256 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 4 ms 256 KB Output is correct
4 Correct 4 ms 256 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 3 ms 256 KB Output is correct
8 Correct 4 ms 256 KB Output is correct
9 Correct 3 ms 256 KB Output is correct

Subtask #3
21.0 / 21.0

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

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 162 ms 436 KB Output is correct
2 Correct 317 ms 1016 KB Output is correct
3 Correct 310 ms 888 KB Output is correct
4 Correct 318 ms 888 KB Output is correct
5 Correct 323 ms 888 KB Output is correct
6 Correct 240 ms 896 KB Output is correct
7 Correct 237 ms 888 KB Output is correct
8 Correct 234 ms 896 KB Output is correct
9 Correct 242 ms 888 KB Output is correct
10 Correct 273 ms 888 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 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 2 ms 256 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 4 ms 256 KB Output is correct
18 Correct 4 ms 256 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 4 ms 384 KB Output is correct
21 Correct 3 ms 256 KB Output is correct
22 Correct 4 ms 256 KB Output is correct
23 Correct 3 ms 256 KB Output is correct
24 Correct 2 ms 256 KB Output is correct
25 Correct 3 ms 256 KB Output is correct
26 Correct 4 ms 256 KB Output is correct
27 Correct 4 ms 256 KB Output is correct
28 Correct 4 ms 256 KB Output is correct
29 Correct 4 ms 256 KB Output is correct
30 Correct 3 ms 256 KB Output is correct
31 Correct 4 ms 256 KB Output is correct
32 Correct 3 ms 384 KB Output is correct
33 Correct 5 ms 256 KB Output is correct
34 Correct 5 ms 256 KB Output is correct
35 Correct 5 ms 256 KB Output is correct
36 Correct 5 ms 256 KB Output is correct
37 Correct 162 ms 436 KB Output is correct
38 Correct 317 ms 1016 KB Output is correct
39 Correct 310 ms 888 KB Output is correct
40 Correct 318 ms 888 KB Output is correct
41 Correct 323 ms 888 KB Output is correct
42 Correct 240 ms 896 KB Output is correct
43 Correct 237 ms 888 KB Output is correct
44 Correct 234 ms 896 KB Output is correct
45 Correct 242 ms 888 KB Output is correct
46 Correct 273 ms 888 KB Output is correct
47 Correct 230 ms 504 KB Output is correct
48 Correct 326 ms 980 KB Output is correct
49 Correct 302 ms 436 KB Output is correct
50 Correct 319 ms 888 KB Output is correct
51 Correct 53 ms 768 KB Output is correct
52 Correct 50 ms 432 KB Output is correct
53 Correct 51 ms 768 KB Output is correct
54 Correct 430 ms 1016 KB Output is correct
55 Correct 402 ms 888 KB Output is correct
56 Correct 364 ms 888 KB Output is correct
57 Correct 330 ms 1016 KB Output is correct