oj.uz

Submission #824841

# Submission time Handle Problem Language Result Execution time Memory
824841 2023-08-14T11:04:08 Z NothingXD Packing Biscuits (IOI20_biscuits) C++17
100 / 100
 49 ms 1324 KB 
#include "biscuits.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

void debug_out(){cerr << endl;}
template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T){
	cerr << H << ' ';
	debug_out(T...);
}

#define debug(...) cerr << "(" << #__VA_ARGS__ << "): ", debug_out(__VA_ARGS__)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define MP(x, y) make_pair(x, y)

const int maxn = 100;
const ll inf = 2e18;

ll dp[maxn][2];

long long count_tastiness(long long x, std::vector<long long> a) {
	dp[0][0] = dp[0][1] = 1;
	for (int i = 1; i <= a.size(); i++){
		dp[i][0] = dp[i][1] = 0;
		ll tmp = (x-a[i-1]%x) % x;
		dp[i][0] = (dp[i-1][1]) * ((a[i-1]+x-1) / x);
		ll idx = i-1;
		while(idx > 0){
			tmp *= 2;
			tmp = min(tmp, inf);
		//	debug(dp[i][0], idx, a[idx-1], tmp);
			if (a[idx-1] < tmp){
				tmp -= a[idx-1];
				idx--;
				continue;
			}
			dp[i][0] += (dp[idx-1][1]) * ((a[idx-1]-tmp+x-1) / x);
			tmp = (x-(a[idx-1]-tmp)%x) % x;
			idx--;
		}
		//debug(tmp);
		if (tmp == 0) dp[i][0]++;
		//debug(i, dp[i][0]);
		if (i == a.size()) break;
		tmp = 0;
		idx = i;
		ll lim = x;
		bool ok = true;
		while(idx > 0){
			tmp *= 2;
			tmp = min(tmp, inf);
		//	debug(dp[i][1], idx, tmp, lim);
			if (lim < a[idx-1]){
				if (tmp > lim){
					ok = false;
					break;
				}
		//		debug((lim-1)-tmp);
				dp[i][1] += dp[idx-1][1] * ((lim-tmp) / x + 1);
				ok = false;
				break;
			}
			if (a[idx-1] < tmp){
				tmp -= a[idx-1];
				lim -= a[idx-1];
				lim *= 2;
				lim = min(lim, inf);
				lim += x;
				lim = min(lim, inf);
				idx--;
				continue;
			}
			dp[i][1] += (dp[idx-1][1]) * ((a[idx-1]-tmp+x-1) / x);
			tmp = (x-(a[idx-1]-tmp)%x) % x;
			lim -= a[idx-1];
			lim *= 2;
			lim = min(lim, inf);
			lim += x;
			lim = min(lim, inf);
			idx--;
		}
		if (ok && tmp == 0) dp[i][1]++;
	//	debug(i, dp[i][1]);
	}
	//debug(a.size(), dp[a.size()][0]);
	return dp[a.size()][0];
}

Compilation message

biscuits.cpp: In function 'long long int count_tastiness(long long int, std::vector<long long int>)':
biscuits.cpp:30:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |  for (int i = 1; i <= a.size(); i++){
      |                  ~~^~~~~~~~~~~
biscuits.cpp:51:9: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |   if (i == a.size()) break;
      |       ~~^~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 304 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 212 KB Output is correct
6 Correct 0 ms 300 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 0 ms 212 KB Output is correct
12 Correct 1 ms 300 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 308 KB Output is correct
7 Correct 0 ms 304 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 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 304 KB Output is correct
6 Correct 1 ms 212 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 212 KB Output is correct
12 Correct 1 ms 304 KB Output is correct
13 Correct 1 ms 212 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 372 KB Output is correct
2 Correct 23 ms 1196 KB Output is correct
3 Correct 22 ms 1200 KB Output is correct
4 Correct 22 ms 1192 KB Output is correct
5 Correct 22 ms 1200 KB Output is correct
6 Correct 20 ms 1108 KB Output is correct
7 Correct 20 ms 1160 KB Output is correct
8 Correct 21 ms 1080 KB Output is correct
9 Correct 21 ms 1140 KB Output is correct
10 Correct 21 ms 1092 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 304 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 212 KB Output is correct
6 Correct 0 ms 300 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 0 ms 212 KB Output is correct
12 Correct 1 ms 300 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 1 ms 304 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 308 KB Output is correct
21 Correct 0 ms 304 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 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 304 KB Output is correct
29 Correct 1 ms 212 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 212 KB Output is correct
35 Correct 1 ms 304 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 372 KB Output is correct
38 Correct 23 ms 1196 KB Output is correct
39 Correct 22 ms 1200 KB Output is correct
40 Correct 22 ms 1192 KB Output is correct
41 Correct 22 ms 1200 KB Output is correct
42 Correct 20 ms 1108 KB Output is correct
43 Correct 20 ms 1160 KB Output is correct
44 Correct 21 ms 1080 KB Output is correct
45 Correct 21 ms 1140 KB Output is correct
46 Correct 21 ms 1092 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 49 ms 1324 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 30 ms 1140 KB Output is correct
51 Correct 15 ms 1320 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 10 ms 1168 KB Output is correct
54 Correct 34 ms 1084 KB Output is correct
55 Correct 36 ms 1172 KB Output is correct
56 Correct 35 ms 1192 KB Output is correct
57 Correct 34 ms 1208 KB Output is correct