oj.uz

Submission #418528

# Submission time Handle Problem Language Result Execution time Memory
418528 2021-06-05T12:55:03 Z oolimry Packing Biscuits (IOI20_biscuits) C++17
100 / 100
 84 ms 1324 KB 
#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;
#define sz(x) (int) (x).size()
#define all(x) (x).begin(), (x).end()
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
typedef long long lint;
typedef pair<lint,lint> ii;

map<lint,lint> memo;
lint S[65];

lint dp(lint n){ ///number of good things <n
	if(n <= 0) return 0;
	if(n == 1) return 1;
	if(memo.find(n) != memo.end()) return memo[n];
	
	lint a = 60;
	while(((1LL<<a)&(n-1))==0) a--;
	
	lint A = (1LL<<a);
	lint B = min(n,S[a]+1) - A;
	
	lint res = dp(A)+dp(B);
	memo[n] = res;
	return res;
}

lint count_tastiness(lint x, vector<lint> a){
	for(lint i = 0;i < 60;i++) S[i] = 0;
	for(lint i = 0;i < sz(a);i++) S[i] += (a[i]<<i);
	for(lint i = 1;i < 60;i++) S[i] += S[i-1];
	for(lint i = 0;i < 60;i++) S[i] /= x;
	
	memo.clear();
	return dp(1LL<<60LL);
}

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 292 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 292 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 204 KB Output is correct
3 Correct 1 ms 288 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 288 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

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 288 KB Output is correct
2 Correct 1 ms 288 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
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 2 ms 204 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 12 ms 332 KB Output is correct
2 Correct 27 ms 824 KB Output is correct
3 Correct 27 ms 1072 KB Output is correct
4 Correct 27 ms 1176 KB Output is correct
5 Correct 27 ms 1100 KB Output is correct
6 Correct 34 ms 1100 KB Output is correct
7 Correct 33 ms 1100 KB Output is correct
8 Correct 32 ms 1128 KB Output is correct
9 Correct 30 ms 1072 KB Output is correct
10 Correct 22 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 292 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 292 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 204 KB Output is correct
17 Correct 1 ms 288 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 288 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 204 KB Output is correct
24 Correct 1 ms 288 KB Output is correct
25 Correct 1 ms 288 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 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 288 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 2 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 12 ms 332 KB Output is correct
38 Correct 27 ms 824 KB Output is correct
39 Correct 27 ms 1072 KB Output is correct
40 Correct 27 ms 1176 KB Output is correct
41 Correct 27 ms 1100 KB Output is correct
42 Correct 34 ms 1100 KB Output is correct
43 Correct 33 ms 1100 KB Output is correct
44 Correct 32 ms 1128 KB Output is correct
45 Correct 30 ms 1072 KB Output is correct
46 Correct 22 ms 1100 KB Output is correct
47 Correct 11 ms 360 KB Output is correct
48 Correct 25 ms 1324 KB Output is correct
49 Correct 14 ms 304 KB Output is correct
50 Correct 22 ms 1072 KB Output is correct
51 Correct 16 ms 1228 KB Output is correct
52 Correct 8 ms 332 KB Output is correct
53 Correct 16 ms 1100 KB Output is correct
54 Correct 84 ms 1100 KB Output is correct
55 Correct 76 ms 1184 KB Output is correct
56 Correct 66 ms 1100 KB Output is correct
57 Correct 55 ms 1212 KB Output is correct