oj.uz

Submission #388500

# Submission time Handle Problem Language Result Execution time Memory
388500 2021-04-11T18:00:38 Z JimmyZJX Packing Biscuits (IOI20_biscuits) C++14
100 / 100
 27 ms 1340 KB 
#include <iostream>
#include <fstream>
#include <algorithm>
#include <cstring>
#include <climits>
#include <cassert>
#include <tuple>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <string>

using namespace std;

typedef long long LL;
typedef vector<int> Vi;
typedef vector<LL> VL;
typedef vector<bool> Vb;
typedef vector<vector<int>> Vii;

#define MAXP 61

#define forR(i, n) for (int i = 0; i < (n); i++)

VL preSum(MAXP);

LL count(LL x, VL a, int p) {
	// [ 0, 2^p ) ++ [ 2^p , 2^(p+1) )

	if (p == 0) {
		return a[0] >= x ? 2 : 1;
	}

	LL count_before_p = count(x, a, p - 1);

	if (a[p] >= x) {
		return 2 * count_before_p;
	} else if (p > 0 && a[p] + (preSum[p - 1] >> p) >= x) {
		LL rest = (x - a[p]) * (1LL << p);

		int c; for (c = p - 1; c >= 0; c--) {
			LL cnt = min(a[c], rest / (1LL << c));
			rest -= cnt * (1LL << c);
			a[c] -= cnt;
			if (rest == 0) break;
		}
		assert(rest == 0);

		LL chooseP = count(x, a, c);
		return count_before_p + chooseP;
	} else {
		return count_before_p;
	}
}

LL count_tastiness(LL x, VL a) {
	int k = a.size();
	a.resize(MAXP);

	LL c = 0;
	forR(i, MAXP) {
		a[i] += c; c = 0;
		if (a[i] > x) {
			c = (a[i] - x) / 2;
			a[i] -= c * 2;
		}
	}

	forR(i, MAXP) {
		preSum[i] = i > 0 ? preSum[i - 1] : 0;
		preSum[i] += ((LL)1 << i) * a[i];
	}

	VL counts(MAXP + 1); // counts[p]: [ 0 , 2^p )
	counts[0] = 1;
	for (int p = 0; p < MAXP; p++) {
		LL CountLeP = counts[p];
		if (a[p] >= x) {
			counts[p + 1] = 2 * CountLeP;
		} else {
			LL countP = CountLeP;
			int r = p;

			LL ar = a[r];
			while (r > 0 && ar + (preSum[r - 1] >> r) >= x) {
				LL rest = (x - ar) * (1LL << r);

				for (r = r - 1; r >= 0; r--) {
					LL cnt = min(a[r], rest / (1LL << r));
					rest -= cnt * (1LL << r);
					if (rest == 0) {
						ar = a[r] - cnt;
						break;
					}
				}
				assert(rest == 0);

				countP += counts[r];
			}

			counts[p + 1] = countP;
		}
	}

	return counts[MAXP];
	// return count(x, a, MAXP - 1);
}


#ifdef TEST_LOCAL
int main() {
	LL res;
	res = count_tastiness(3, VL{ 5,2,1 });
	res = count_tastiness(2, VL{ 2,1,2 });

	return 0;
}
#endif

Compilation message

biscuits.cpp: In function 'LL count_tastiness(LL, VL)':
biscuits.cpp:59:6: warning: unused variable 'k' [-Wunused-variable]
   59 |  int k = a.size();
      |      ^

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 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 0 ms 204 KB Output is correct
14 Correct 0 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 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 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 0 ms 204 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 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 0 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

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 11 ms 716 KB Output is correct
3 Correct 11 ms 1196 KB Output is correct
4 Correct 11 ms 1192 KB Output is correct
5 Correct 11 ms 1100 KB Output is correct
6 Correct 11 ms 1100 KB Output is correct
7 Correct 11 ms 1144 KB Output is correct
8 Correct 11 ms 1132 KB Output is correct
9 Correct 11 ms 1164 KB Output is correct
10 Correct 10 ms 1172 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 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 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 0 ms 204 KB Output is correct
14 Correct 0 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 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 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 0 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 0 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 0 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 2 ms 332 KB Output is correct
38 Correct 11 ms 716 KB Output is correct
39 Correct 11 ms 1196 KB Output is correct
40 Correct 11 ms 1192 KB Output is correct
41 Correct 11 ms 1100 KB Output is correct
42 Correct 11 ms 1100 KB Output is correct
43 Correct 11 ms 1144 KB Output is correct
44 Correct 11 ms 1132 KB Output is correct
45 Correct 11 ms 1164 KB Output is correct
46 Correct 10 ms 1172 KB Output is correct
47 Correct 2 ms 312 KB Output is correct
48 Correct 11 ms 1340 KB Output is correct
49 Correct 3 ms 460 KB Output is correct
50 Correct 10 ms 1180 KB Output is correct
51 Correct 12 ms 1332 KB Output is correct
52 Correct 2 ms 332 KB Output is correct
53 Correct 9 ms 1100 KB Output is correct
54 Correct 15 ms 1100 KB Output is correct
55 Correct 17 ms 1208 KB Output is correct
56 Correct 18 ms 1208 KB Output is correct
57 Correct 27 ms 1192 KB Output is correct