oj.uz

Submission #622374

# Submission time Handle Problem Language Result Execution time Memory
622374 2022-08-04T08:27:40 Z 8e7 Packing Biscuits (IOI20_biscuits) C++17
100 / 100
 16 ms 952 KB 
//Challenge: Accepted
#include <bits/stdc++.h>
using namespace std;
#ifdef zisk
void debug(){cout << endl;}
template<class T, class ... U> void debug(T a, U ... b){cout << a << " ", debug(b...);}
template<class T> void pary(T l, T r){
	while (l != r) cout << *l << " ", l++;
	cout << endl;
}
#else
#define debug(...) 0
#define pary(...) 0
#endif
#define ll long long
#define lb ll
#define maxn 100005
#define pii pair<int, int>
#define ff first
#define ss second
#include "biscuits.h"

vector<lb> f, sum;

lb getcnt(lb v, int k) {
	if (v < 0) return 0;
	if (k < 0) return 1;
	if (v>>k) {
		return (k ? sum[k-1] : 1) + getcnt(min(v - ((v>>k)<<k), f[k]), k-1);
	} else {
		return getcnt(v, k-1);
	}
}
long long count_tastiness(long long x, std::vector<long long> a) {
	while (a.size() < 61) a.push_back(0);
	int k = a.size();
	for (int i = 0;i < k-1;i++) {
		ll d = max(0LL, ((a[i] - x)/2)*2);
		a[i] -= d;
		a[i+1] += d/2;
	}
	f.clear(), sum.clear();
	f.resize(k, 0);
	sum.resize(k, 0);
	
	for (int i = 0;i < k;i++) {
		lb tot = 0, se = 0;	
		for (int j = i-1;j >= 0;j--) {
			se <<= 1;
			se++;
			tot <<= 1;
			tot += a[j];
		}
		if (((tot + (((lb)a[i])<<i))>>i) < x)tot = -1;
		else tot = min(tot, tot + (((lb)(a[i] - x))<<i));
		if (tot < 0) tot = -1;
		else tot = tot / x;
		tot = min(tot, se);
		f[i] = tot;
	}
	//pary(f.begin(), f.end());
	
	for (int i = 0;i < k;i++) {
		sum[i] = (i ? sum[i-1] : 1) + getcnt(f[i], i-1);
	}
	return (long long)sum[k-1];
}
/*

1
1 40
1000

*/

Subtask #1
9.0 / 9.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 1 ms 304 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct

Subtask #3
21.0 / 21.0

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

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 340 KB Output is correct
2 Correct 10 ms 752 KB Output is correct
3 Correct 10 ms 820 KB Output is correct
4 Correct 10 ms 724 KB Output is correct
5 Correct 10 ms 820 KB Output is correct
6 Correct 9 ms 824 KB Output is correct
7 Correct 9 ms 724 KB Output is correct
8 Correct 10 ms 724 KB Output is correct
9 Correct 10 ms 724 KB Output is correct
10 Correct 11 ms 724 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 224 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 304 KB Output is correct
18 Correct 1 ms 300 KB Output is correct
19 Correct 1 ms 296 KB Output is correct
20 Correct 1 ms 304 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 304 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 300 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 1 ms 300 KB Output is correct
37 Correct 4 ms 340 KB Output is correct
38 Correct 10 ms 752 KB Output is correct
39 Correct 10 ms 820 KB Output is correct
40 Correct 10 ms 724 KB Output is correct
41 Correct 10 ms 820 KB Output is correct
42 Correct 9 ms 824 KB Output is correct
43 Correct 9 ms 724 KB Output is correct
44 Correct 10 ms 724 KB Output is correct
45 Correct 10 ms 724 KB Output is correct
46 Correct 11 ms 724 KB Output is correct
47 Correct 5 ms 340 KB Output is correct
48 Correct 16 ms 928 KB Output is correct
49 Correct 7 ms 408 KB Output is correct
50 Correct 15 ms 852 KB Output is correct
51 Correct 12 ms 952 KB Output is correct
52 Correct 4 ms 340 KB Output is correct
53 Correct 11 ms 808 KB Output is correct
54 Correct 12 ms 936 KB Output is correct
55 Correct 12 ms 852 KB Output is correct
56 Correct 12 ms 872 KB Output is correct
57 Correct 12 ms 860 KB Output is correct