oj.uz

Submission #441857

# Submission time Handle Problem Language Result Execution time Memory
441857 2021-07-06T11:18:09 Z FSYo Packing Biscuits (IOI20_biscuits) C++14
100 / 100
 18 ms 1360 KB 
#include<bits/stdc++.h>
#define cs const
#define pb push_back
using namespace std;
typedef long long ll;
cs int N = 64; 
ll sm[N], dp[N][N], lm[N];

ll count_tastiness(ll x, vector<ll> a) {
	a.resize(61);
	memset(sm, 0, sizeof sm);
	for(int i = 0; i < 61; i++)
		sm[i] = (i ? sm[i - 1] : 0) + (a[i] << i);
	for(int i = 0; i < 61; i++) {
		lm[i] = sm[i] / x - (1ll << i);
		lm[i] = min(lm[i], min((1ll << i) - 1, sm[i - 1]));
	}
	memset(dp, 0, sizeof dp);
	dp[61][61] = 1; 
	for(ll i = 60, c; ~i; i--) {
		// first 
		dp[i][61] = dp[i + 1][61];
		if(lm[i] >= 0) dp[i][i] = dp[i + 1][61]; 
		ll mask = (1ll << i) - 1;
		for(int j = i + 1; j <= 60; j++) 
		if(c = dp[i + 1][j]){
			// choose 
			if((lm[j] >> i & 1) && lm[i] >= 0) {
				if((lm[j] & mask) > lm[i]) 
					dp[i][i] += c; 
				else 	
					dp[i][j] += c; 
			}
			// not choose
			if(lm[j] >> i & 1) {
				dp[i][61] += c; 
			}
			else {
				dp[i][j] += c; 
			}
		}
	}
	ll ans = 0; 
	for(int i = 0; i <= 61; i++)
		if(lm[i] >= 0) ans += dp[0][i];
//	exit(0);
	return ans; 
}

#ifdef FSYo
int main() {
	freopen("1.in", "r", stdin);
	int T;
	cin >> T; 
	while(T--) {
		ll k, x; 
		cin >> k >> x; 
		vector<ll> a(k);
		for(int i = 0; i < k; i++)
			cin >> a[i];
		cout << count_tastiness(x, a) << '\n';
	}
	return 0; 
}
#endif

Compilation message

biscuits.cpp: In function 'll count_tastiness(ll, std::vector<long long int>)':
biscuits.cpp:26:8: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   26 |   if(c = dp[i + 1][j]){
      |      ~~^~~~~~~~~~~~~~

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 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 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 332 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 332 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 1 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 332 KB Output is correct
9 Correct 1 ms 204 KB Output is correct

Subtask #3
21.0 / 21.0

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

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 332 KB Output is correct
2 Correct 14 ms 812 KB Output is correct
3 Correct 14 ms 1120 KB Output is correct
4 Correct 16 ms 1228 KB Output is correct
5 Correct 14 ms 1228 KB Output is correct
6 Correct 13 ms 1100 KB Output is correct
7 Correct 15 ms 1100 KB Output is correct
8 Correct 14 ms 1100 KB Output is correct
9 Correct 14 ms 1084 KB Output is correct
10 Correct 13 ms 1144 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 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 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 332 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 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 332 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 292 KB Output is correct
26 Correct 1 ms 292 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 296 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 5 ms 332 KB Output is correct
38 Correct 14 ms 812 KB Output is correct
39 Correct 14 ms 1120 KB Output is correct
40 Correct 16 ms 1228 KB Output is correct
41 Correct 14 ms 1228 KB Output is correct
42 Correct 13 ms 1100 KB Output is correct
43 Correct 15 ms 1100 KB Output is correct
44 Correct 14 ms 1100 KB Output is correct
45 Correct 14 ms 1084 KB Output is correct
46 Correct 13 ms 1144 KB Output is correct
47 Correct 6 ms 460 KB Output is correct
48 Correct 18 ms 1328 KB Output is correct
49 Correct 7 ms 436 KB Output is correct
50 Correct 16 ms 1100 KB Output is correct
51 Correct 14 ms 1360 KB Output is correct
52 Correct 6 ms 332 KB Output is correct
53 Correct 12 ms 1132 KB Output is correct
54 Correct 18 ms 1200 KB Output is correct
55 Correct 16 ms 1144 KB Output is correct
56 Correct 16 ms 1228 KB Output is correct
57 Correct 16 ms 1236 KB Output is correct