Submission #306038

# Submission time Handle Problem Language Result Execution time Memory
306038 2020-09-24T10:48:01 Z Yousef_Salama Packing Biscuits (IOI20_biscuits) C++17
100 / 100
88 ms 1016 KB
#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;

long long count_tastiness(long long x, vector <long long> a){
	a.resize(60, 0);
	const int k = 60;
	
	vector <long long> p2(k);
	
	p2[0] = 1;
	for(int i = 1; i < k; i++)
		p2[i] = p2[i - 1] * 2;
	
	vector < vector <long long> > b(k, vector <long long>(k));
	for(int i = 0; i < k; i++){
		long long total = 0;
		for(int j = 0; j <= i; j++)
			total += p2[j] * a[j];
			
		for(int j = i; j >= 0; j--){
			if(total / p2[j] >= x){
				b[k - i - 1][k - j - 1] = 1;
				total -= p2[j] * x;
			}else{
				b[k - i - 1][k - j - 1] = 0;
			}
		}
	}
	
	/*
	for(int i = 0; i < k; i++){
		for(int j = 0; j < k; j++)
			cout << b[i][j] << ' ';
		cout << endl;
	}
	*/
	
	auto cmp = [&](int i, int j){
					for(int l = max(i, j); l < k; l++){
						if(b[i][l] < b[j][l]){
							return true;
						}else if(b[i][l] > b[j][l]){
							return false;
						}
					}
					return false;
				};
	
	vector < vector <long long> > dp(k, vector <long long>(k));
	
	for(int i = k - 1; i >= 0; i--)
	for(int j = 0; j <= i; j++){
		if(i == k - 1){
			if(b[j][i] == 1)dp[i][j] = 2;
			else dp[i][j] = 1;
		}else{
			if(cmp(j, i + 1))dp[i][j] = dp[i + 1][j];
			else dp[i][j] = dp[i + 1][i + 1];

			if(b[j][i] == 1)dp[i][j] += dp[i + 1][i + 1];
		}
	}
	
	return dp[0][0];
}

/*
int main(){
	cout << count_tastiness(3, {5, 2, 1}) << endl;
	cout << count_tastiness(2, {2, 1, 2}) << endl;
	cout << count_tastiness(1, {2, 1, 2}) << endl;
	
	return 0;
}
*/
# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 512 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 416 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 64 ms 384 KB Output is correct
2 Correct 83 ms 1016 KB Output is correct
3 Correct 80 ms 896 KB Output is correct
4 Correct 81 ms 948 KB Output is correct
5 Correct 81 ms 1016 KB Output is correct
6 Correct 74 ms 896 KB Output is correct
7 Correct 75 ms 896 KB Output is correct
8 Correct 76 ms 896 KB Output is correct
9 Correct 76 ms 896 KB Output is correct
10 Correct 80 ms 896 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 512 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 416 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 64 ms 384 KB Output is correct
38 Correct 83 ms 1016 KB Output is correct
39 Correct 80 ms 896 KB Output is correct
40 Correct 81 ms 948 KB Output is correct
41 Correct 81 ms 1016 KB Output is correct
42 Correct 74 ms 896 KB Output is correct
43 Correct 75 ms 896 KB Output is correct
44 Correct 76 ms 896 KB Output is correct
45 Correct 76 ms 896 KB Output is correct
46 Correct 80 ms 896 KB Output is correct
47 Correct 64 ms 504 KB Output is correct
48 Correct 82 ms 896 KB Output is correct
49 Correct 59 ms 504 KB Output is correct
50 Correct 81 ms 768 KB Output is correct
51 Correct 85 ms 1016 KB Output is correct
52 Correct 76 ms 488 KB Output is correct
53 Correct 88 ms 824 KB Output is correct
54 Correct 73 ms 1016 KB Output is correct
55 Correct 75 ms 896 KB Output is correct
56 Correct 79 ms 1016 KB Output is correct
57 Correct 81 ms 896 KB Output is correct