Submission #614186

# Submission time Handle Problem Language Result Execution time Memory
614186 2022-07-30T21:22:50 Z penguinhacker Packing Biscuits (IOI20_biscuits) C++17
100 / 100
23 ms 1364 KB
#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ar array

ll count_tastiness(ll x, vector<ll> a) {
	vector<ll> v(60);
	for (int i=0; i<a.size(); ++i)
		v[i]+=(1ll*a[i])<<i;
	for (int i=1; i<60; ++i)
		v[i]+=v[i-1];
	for (int i=0; i<60; ++i)
		v[i]=min(v[i]/x, (1ll<<i+1)-1);
	vector<vector<ll>> dp(60, vector<ll>(60));
	for (int i=0; i<60; ++i) {
		for (int j=i; j<60; ++j) {
			ll mask=v[j]&((1ll<<i+1)-1);
			if (!i) {
				dp[i][j]=mask+1;
				continue;
			}
			if (mask&1ll<<i)
				dp[i][j]=dp[i-1][i-1]+dp[i-1][mask-(1ll<<i)<=v[i-1]?j:i-1];
			else
				dp[i][j]=dp[i-1][mask<=v[i-1]?j:i-1];
		}
	}
	return dp[59][59];
}

Compilation message

biscuits.cpp: In function 'long long int count_tastiness(long long int, std::vector<long long int>)':
biscuits.cpp:10:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 |  for (int i=0; i<a.size(); ++i)
      |                ~^~~~~~~~~
biscuits.cpp:15:27: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
   15 |   v[i]=min(v[i]/x, (1ll<<i+1)-1);
      |                          ~^~
biscuits.cpp:19:25: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
   19 |    ll mask=v[j]&((1ll<<i+1)-1);
      |                        ~^~
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 212 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 296 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 340 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 300 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 296 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 300 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 332 KB Output is correct
11 Correct 1 ms 304 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 11 ms 340 KB Output is correct
2 Correct 23 ms 1148 KB Output is correct
3 Correct 17 ms 1104 KB Output is correct
4 Correct 17 ms 1108 KB Output is correct
5 Correct 17 ms 1220 KB Output is correct
6 Correct 18 ms 1160 KB Output is correct
7 Correct 16 ms 1108 KB Output is correct
8 Correct 18 ms 1176 KB Output is correct
9 Correct 17 ms 1184 KB Output is correct
10 Correct 18 ms 1076 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 212 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 296 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 340 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 300 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 300 KB Output is correct
24 Correct 1 ms 296 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 296 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 0 ms 300 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 332 KB Output is correct
34 Correct 1 ms 304 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 11 ms 340 KB Output is correct
38 Correct 23 ms 1148 KB Output is correct
39 Correct 17 ms 1104 KB Output is correct
40 Correct 17 ms 1108 KB Output is correct
41 Correct 17 ms 1220 KB Output is correct
42 Correct 18 ms 1160 KB Output is correct
43 Correct 16 ms 1108 KB Output is correct
44 Correct 18 ms 1176 KB Output is correct
45 Correct 17 ms 1184 KB Output is correct
46 Correct 18 ms 1076 KB Output is correct
47 Correct 9 ms 340 KB Output is correct
48 Correct 17 ms 1336 KB Output is correct
49 Correct 11 ms 340 KB Output is correct
50 Correct 16 ms 1180 KB Output is correct
51 Correct 16 ms 1364 KB Output is correct
52 Correct 9 ms 440 KB Output is correct
53 Correct 16 ms 1100 KB Output is correct
54 Correct 18 ms 1196 KB Output is correct
55 Correct 17 ms 1208 KB Output is correct
56 Correct 19 ms 1108 KB Output is correct
57 Correct 16 ms 1240 KB Output is correct