oj.uz

Submission #877669

# Submission time Handle Problem Language Result Execution time Memory
877669 2023-11-23T12:29:17 Z abczz Packing Biscuits (IOI20_biscuits) C++14
100 / 100
 50 ms 1892 KB 
#include "biscuits.h"
#include <iostream>
#include <vector>
#define ll long long
#define ull __int128

using namespace std;

ll dp[121][121][2], f;

long long count_tastiness(long long x, std::vector<long long> a) {
	vector <ull> V;
	ull z = x, s = 1, y = 1;
	f = 0;
	for (auto u : a) V.push_back(u);
	while (V.size() < 120) V.push_back(0);
	for (int i=0; i<V.size(); ++i) {
		s *= 2;
		for (int j=0; j<i; ++j) {
			V[i] *= 2;
		}
		if (i) V[i] += V[i-1];
	}
	for (int i=0; i<V.size(); ++i) {
		for (int j=0; j<V.size(); ++j) {
			dp[i][j][0] = dp[i][j][1] = 0;
		}
	}
	for (int i=0; i<V.size(); ++i) {
		y *= 2;
		V[i] /= z;
		V[i] = min(V[i], y-1);
		//cout << (ll)V[i] << " ";
	}
	//cout << endl;
	y /= 2;
	if ((V.back() & y)) ++dp[V.size()-1][V.size()-1][0];
	++dp[V.size()-1][V.size()-1][1];
	for (int i=V.size()-1; i>0; --i) {
		y /= 2;
		s /= 2;
		for (int j=i; j<V.size(); ++j) {
			//cout << i << " " << j << " " << dp[i][j][0] << endl;
			//cout << i << " " << j << " " << dp[i][j][1] << endl;
			if ((V[i-1] & y)) dp[i-1][i-1][0] += dp[i][j][0];
			dp[i-1][i-1][1] += dp[i][j][0];
			if ((V[j] & (s-1)) <= (V[i-1] & (s-1))) {
				if ((V[j] & y)) dp[i-1][j][0] += dp[i][j][1];
				dp[i-1][j][1] += dp[i][j][1];
			}
			else {
				if ((V[i-1] & y)) dp[i-1][i-1][0] += dp[i][j][1];
				dp[i-1][i-1][1] += dp[i][j][1];
			}
		}
	}
	for (int i=0; i<V.size(); ++i) {
		f += dp[0][i][0] + dp[0][i][1];
	}
	return f;
}

Compilation message

biscuits.cpp: In function 'long long int count_tastiness(long long int, std::vector<long long int>)':
biscuits.cpp:17:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<__int128>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |  for (int i=0; i<V.size(); ++i) {
      |                ~^~~~~~~~~
biscuits.cpp:24:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<__int128>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |  for (int i=0; i<V.size(); ++i) {
      |                ~^~~~~~~~~
biscuits.cpp:25:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<__int128>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |   for (int j=0; j<V.size(); ++j) {
      |                 ~^~~~~~~~~
biscuits.cpp:29:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<__int128>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |  for (int i=0; i<V.size(); ++i) {
      |                ~^~~~~~~~~
biscuits.cpp:42:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<__int128>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |   for (int j=i; j<V.size(); ++j) {
      |                 ~^~~~~~~~~
biscuits.cpp:57:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<__int128>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |  for (int i=0; i<V.size(); ++i) {
      |                ~^~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 1 ms 436 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 444 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 680 KB Output is correct
14 Correct 1 ms 604 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct

Subtask #3
21.0 / 21.0

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

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 604 KB Output is correct
2 Correct 43 ms 1360 KB Output is correct
3 Correct 43 ms 1380 KB Output is correct
4 Correct 42 ms 1372 KB Output is correct
5 Correct 44 ms 1536 KB Output is correct
6 Correct 42 ms 1368 KB Output is correct
7 Correct 50 ms 1516 KB Output is correct
8 Correct 42 ms 1372 KB Output is correct
9 Correct 43 ms 1372 KB Output is correct
10 Correct 43 ms 1368 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 1 ms 436 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 444 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 680 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 600 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 1 ms 600 KB Output is correct
34 Correct 1 ms 604 KB Output is correct
35 Correct 1 ms 600 KB Output is correct
36 Correct 1 ms 604 KB Output is correct
37 Correct 34 ms 604 KB Output is correct
38 Correct 43 ms 1360 KB Output is correct
39 Correct 43 ms 1380 KB Output is correct
40 Correct 42 ms 1372 KB Output is correct
41 Correct 44 ms 1536 KB Output is correct
42 Correct 42 ms 1368 KB Output is correct
43 Correct 50 ms 1516 KB Output is correct
44 Correct 42 ms 1372 KB Output is correct
45 Correct 43 ms 1372 KB Output is correct
46 Correct 43 ms 1368 KB Output is correct
47 Correct 35 ms 604 KB Output is correct
48 Correct 41 ms 1624 KB Output is correct
49 Correct 36 ms 604 KB Output is correct
50 Correct 40 ms 1508 KB Output is correct
51 Correct 37 ms 1892 KB Output is correct
52 Correct 34 ms 604 KB Output is correct
53 Correct 38 ms 1532 KB Output is correct
54 Correct 42 ms 1512 KB Output is correct
55 Correct 43 ms 1372 KB Output is correct
56 Correct 42 ms 1372 KB Output is correct
57 Correct 41 ms 1372 KB Output is correct