oj.uz

Submission #388447

# Submission time Handle Problem Language Result Execution time Memory
388447 2021-04-11T15:00:35 Z JimmyZJX Packing Biscuits (IOI20_biscuits) C++14
9 / 100
 1000 ms 332 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);
		for (int c = p - 1; c >= 0 && rest > 0; c--) {
			LL cnt = min(a[c], rest / (1LL << c));
			rest -= cnt * (1LL << c);
			a[c] -= cnt;
		}

		if (rest == 0) {
			// succeed
			return count_before_p + count(x, a, p - 1);
		} else {
			// failed
			return count_before_p;
		}
	} else {
		return count_before_p;
	}
}

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

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

	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:61:6: warning: unused variable 'k' [-Wunused-variable]
   61 |  int k = a.size();
      |      ^

Subtask #1
9.0 / 9.0

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

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 204 KB Output is correct
2 Execution timed out 1087 ms 296 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1091 ms 204 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1092 ms 332 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 5 ms 332 KB Output is correct
5 Correct 2 ms 204 KB Output is correct
6 Correct 6 ms 328 KB Output is correct
7 Correct 2 ms 204 KB Output is correct
8 Correct 5 ms 204 KB Output is correct
9 Correct 3 ms 332 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 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 7 ms 204 KB Output is correct
16 Execution timed out 1087 ms 296 KB Time limit exceeded
17 Halted 0 ms 0 KB -