oj.uz

Submission #399639

# Submission time Handle Problem Language Result Execution time Memory
399639 2021-05-06T10:37:13 Z nvmdava Packing Biscuits (IOI20_biscuits) C++17
100 / 100
 93 ms 1320 KB 
#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long

map<ll, ll> res;
const ll MAX = 1'000'000'000'000'000'000;
ll s[100];
ll find(ll r){
	if(r < 0) return 0;
	if(r == 0) return 1;
	if(res.count(r))
		return res[r];
	int i = (int)floor(log2(r));
	while((1LL << i ) > r )
		--i;
	return res[r] = find((1LL << i) - 1) + find(min(r, s[i])- (1LL << i));
}

long long count_tastiness(long long x, std::vector<long long> a) {
	res.clear();
	while(a.size() < 60)
		a.push_back(0);

	for(int i = 0; i < 59; ++i){
		ll t = max(0LL, (a[i] - x) / 2);
		a[i] -= t * 2;
		a[i + 1] += t;
	}
	a[59] = min(a[59], x + 1);
	ll t = 0;
	s[0] = a[0] / x;
	t = a[0] % x;
	for(int i = 1; i < 60; ++i){
		s[i] = s[i - 1];
		for(int j = i; j > 0; --j){
			while(a[i] >= x){
				s[i] = min(MAX, s[i] + (1LL << j));
				a[i] -= x;
			}
			a[i] <<= 1;
		}
		while(a[i] >= x){
			a[i] -= x;
			++s[i];
		}
		t += a[i];
		while(t >= x){
			t -= x;
			++s[i];
		}
	}
	return find(MAX);
}

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 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 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 300 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 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 1 ms 204 KB Output is correct
7 Correct 1 ms 296 KB Output is correct
8 Correct 1 ms 304 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 2 ms 204 KB Output is correct
12 Correct 3 ms 204 KB Output is correct
13 Correct 2 ms 204 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 332 KB Output is correct
2 Correct 34 ms 824 KB Output is correct
3 Correct 34 ms 716 KB Output is correct
4 Correct 33 ms 812 KB Output is correct
5 Correct 33 ms 716 KB Output is correct
6 Correct 41 ms 740 KB Output is correct
7 Correct 40 ms 820 KB Output is correct
8 Correct 38 ms 800 KB Output is correct
9 Correct 38 ms 744 KB Output is correct
10 Correct 29 ms 716 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 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 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 300 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 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 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 1 ms 204 KB Output is correct
30 Correct 1 ms 296 KB Output is correct
31 Correct 1 ms 304 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 208 KB Output is correct
34 Correct 2 ms 204 KB Output is correct
35 Correct 3 ms 204 KB Output is correct
36 Correct 2 ms 204 KB Output is correct
37 Correct 13 ms 332 KB Output is correct
38 Correct 34 ms 824 KB Output is correct
39 Correct 34 ms 716 KB Output is correct
40 Correct 33 ms 812 KB Output is correct
41 Correct 33 ms 716 KB Output is correct
42 Correct 41 ms 740 KB Output is correct
43 Correct 40 ms 820 KB Output is correct
44 Correct 38 ms 800 KB Output is correct
45 Correct 38 ms 744 KB Output is correct
46 Correct 29 ms 716 KB Output is correct
47 Correct 15 ms 380 KB Output is correct
48 Correct 29 ms 1320 KB Output is correct
49 Correct 17 ms 408 KB Output is correct
50 Correct 28 ms 1160 KB Output is correct
51 Correct 20 ms 1228 KB Output is correct
52 Correct 13 ms 332 KB Output is correct
53 Correct 19 ms 1060 KB Output is correct
54 Correct 93 ms 1164 KB Output is correct
55 Correct 85 ms 1180 KB Output is correct
56 Correct 75 ms 1200 KB Output is correct
57 Correct 63 ms 1224 KB Output is correct