oj.uz

Submission #430393

# Submission time Handle Problem Language Result Execution time Memory
430393 2021-06-16T13:19:53 Z alireza_kaviani Packing Biscuits (IOI20_biscuits) C++17
100 / 100
 349 ms 1348 KB 
#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

#define sep ' '

const int MAXN = 62;
ll x , A[MAXN];
map<ll , ll> dp[MAXN];

ll solve(int i , ll j){
	if(i == -1)	return (j == 0);
	if(j >= 4 * x)	return 0;
	if(dp[i].find(j) != dp[i].end())	return dp[i][j];
	ll y = max(0ll , j - A[i]) * 2;
	dp[i][j] = solve(i - 1 , y) + solve(i - 1 , x + y);
//	cout << i << sep << j << sep << dp[i][j] << endl;
	return dp[i][j];
}

ll count_tastiness(ll x, vector<ll> a) {
	::x = x; int n = a.size();
	for(int i = 0 ; i < MAXN ; i++){
		dp[i] = map<ll , ll>(); A[i] = 0;
	}
	for(int i = 0 ; i < n ; i++){
		A[i] = a[i];
	}
	for(int i = 0 ; i + 1 < MAXN ; i++){
		ll val = min(A[i] , A[i] % x + x);
		if(val % 2 != A[i] % 2)	val++;
		A[i + 1] += (A[i] - val) / 2;
		A[i] = val;
//		cout << A[i] << sep;
	}
//	cout << sep << A[61] << endl;
	return solve(61 , 0);
}

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 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 2 ms 296 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 296 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 2 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 2 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 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 2 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 2 ms 296 KB Output is correct
11 Correct 4 ms 332 KB Output is correct
12 Correct 5 ms 364 KB Output is correct
13 Correct 4 ms 332 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 384 KB Output is correct
2 Correct 141 ms 1256 KB Output is correct
3 Correct 131 ms 1348 KB Output is correct
4 Correct 128 ms 1280 KB Output is correct
5 Correct 124 ms 1252 KB Output is correct
6 Correct 228 ms 1212 KB Output is correct
7 Correct 204 ms 1224 KB Output is correct
8 Correct 169 ms 1100 KB Output is correct
9 Correct 177 ms 1224 KB Output is correct
10 Correct 115 ms 1220 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 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 2 ms 296 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 296 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 2 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 2 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 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 2 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 2 ms 296 KB Output is correct
34 Correct 4 ms 332 KB Output is correct
35 Correct 5 ms 364 KB Output is correct
36 Correct 4 ms 332 KB Output is correct
37 Correct 22 ms 384 KB Output is correct
38 Correct 141 ms 1256 KB Output is correct
39 Correct 131 ms 1348 KB Output is correct
40 Correct 128 ms 1280 KB Output is correct
41 Correct 124 ms 1252 KB Output is correct
42 Correct 228 ms 1212 KB Output is correct
43 Correct 204 ms 1224 KB Output is correct
44 Correct 169 ms 1100 KB Output is correct
45 Correct 177 ms 1224 KB Output is correct
46 Correct 115 ms 1220 KB Output is correct
47 Correct 26 ms 392 KB Output is correct
48 Correct 44 ms 1348 KB Output is correct
49 Correct 21 ms 416 KB Output is correct
50 Correct 31 ms 1156 KB Output is correct
51 Correct 30 ms 1228 KB Output is correct
52 Correct 19 ms 332 KB Output is correct
53 Correct 42 ms 1100 KB Output is correct
54 Correct 296 ms 1272 KB Output is correct
55 Correct 349 ms 1296 KB Output is correct
56 Correct 305 ms 1300 KB Output is correct
57 Correct 250 ms 1292 KB Output is correct