oj.uz

Submission #932095

# Submission time Handle Problem Language Result Execution time Memory
932095 2024-02-23T01:29:06 Z beaboss Packing Biscuits (IOI20_biscuits) C++14
100 / 100
 29 ms 1372 KB 
// Source: https://oj.uz/problem/view/IOI20_biscuits
// 

#include "bits/stdc++.h"

using namespace std;

#define s second
#define f first
#define pb push_back

typedef long long ll;

typedef pair<ll, ll> pii;
typedef vector<pii> vpii;

typedef vector<ll> vi;

#define FOR(i, a, b) for (ll i = (a); i<b; i++)

bool ckmin(ll& a, ll b){ return b < a ? a = b, true : false; }

bool ckmax(ll& a, ll b){ return b > a ? a = b, true : false; }



ll count_tastiness(ll x, vector<ll> a) {

	vi dp(61);
	a.resize(60, 0);
	dp[0]=1;

	FOR(i, 1, 61) {
		ll mx = 0;
		ll alr = 0;
		ll tot = 0;

		for (ll j = i-1; j >= 0; j--) {
			tot += (1ll << j) * a[j]; // biscuits we have
			ll groups = (tot / x) >> j ; // stuff we can make here, wrt j
			mx = 2ll * mx + 1ll; // add extra 1 bit
			// cout << mx << endl;
			groups = min(groups, mx);

			groups++; // being empty

			// cout << i << ' ' << groups << ' ' << alr << endl;
			// assert(alr <= groups);

			dp[i] += dp[j] * max(groups - alr, 0ll);

			alr = max(groups, alr) * 2ll;
		}
		// break;
	}

	return dp[60];

}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 428 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 436 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 444 KB Output is correct
9 Correct 1 ms 600 KB Output is correct

Subtask #3
21.0 / 21.0

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

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 516 KB Output is correct
2 Correct 20 ms 1124 KB Output is correct
3 Correct 20 ms 1340 KB Output is correct
4 Correct 20 ms 1120 KB Output is correct
5 Correct 20 ms 1364 KB Output is correct
6 Correct 22 ms 1252 KB Output is correct
7 Correct 28 ms 1116 KB Output is correct
8 Correct 23 ms 1116 KB Output is correct
9 Correct 22 ms 1116 KB Output is correct
10 Correct 20 ms 1084 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 428 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 436 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 600 KB Output is correct
16 Correct 1 ms 600 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 444 KB Output is correct
23 Correct 1 ms 600 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 600 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 9 ms 516 KB Output is correct
38 Correct 20 ms 1124 KB Output is correct
39 Correct 20 ms 1340 KB Output is correct
40 Correct 20 ms 1120 KB Output is correct
41 Correct 20 ms 1364 KB Output is correct
42 Correct 22 ms 1252 KB Output is correct
43 Correct 28 ms 1116 KB Output is correct
44 Correct 23 ms 1116 KB Output is correct
45 Correct 22 ms 1116 KB Output is correct
46 Correct 20 ms 1084 KB Output is correct
47 Correct 10 ms 344 KB Output is correct
48 Correct 29 ms 1372 KB Output is correct
49 Correct 10 ms 344 KB Output is correct
50 Correct 27 ms 1308 KB Output is correct
51 Correct 15 ms 1368 KB Output is correct
52 Correct 10 ms 344 KB Output is correct
53 Correct 14 ms 1116 KB Output is correct
54 Correct 22 ms 1116 KB Output is correct
55 Correct 22 ms 1116 KB Output is correct
56 Correct 22 ms 1116 KB Output is correct
57 Correct 20 ms 1244 KB Output is correct