oj.uz

Submission #305573

# Submission time Handle Problem Language Result Execution time Memory
305573 2020-09-23T14:57:40 Z emanIaicepsa Packing Biscuits (IOI20_biscuits) C++17
100 / 100
 92 ms 1144 KB 
#include "biscuits.h"
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll arr[65], lim[65], X;
map<ll, ll> dp[65];

ll calc(ll i, ll j){
	j = min(j, 2*X);
	if(dp[i][j]) return dp[i][j];
	if(j >= X){
		if(i > 0) dp[i][j] += calc(i-1, min(lim[i], j-X) * 2 + arr[i-1]);
		else dp[i][j]++;
	}
	if(i > 0) dp[i][j] += calc(i-1, min(lim[i], j) * 2 + arr[i-1]);
	else dp[i][j]++;
	return dp[i][j];
}

ll count_tastiness(long long x, std::vector<long long> a) {
	memset(arr, 0, sizeof(arr));
	memset(lim, 0, sizeof(lim));
	for(int i=0;i<63;i++) dp[i].clear();
	X = x;

	for(int i=0;i<a.size();i++) arr[i] = a[i];
	for(int i=0;i<62;i++) lim[i+1] = arr[i]/2, arr[i+1] += arr[i]/2, arr[i] %= 2; 
	return calc(62, arr[62]);
}

Compilation message

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

Subtask #1
9.0 / 9.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 384 KB Output is correct
2 Correct 31 ms 896 KB Output is correct
3 Correct 31 ms 896 KB Output is correct
4 Correct 30 ms 896 KB Output is correct
5 Correct 29 ms 1016 KB Output is correct
6 Correct 42 ms 896 KB Output is correct
7 Correct 42 ms 912 KB Output is correct
8 Correct 37 ms 896 KB Output is correct
9 Correct 36 ms 896 KB Output is correct
10 Correct 23 ms 896 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 256 KB Output is correct
26 Correct 1 ms 256 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 256 KB Output is correct
33 Correct 2 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 2 ms 384 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 7 ms 384 KB Output is correct
38 Correct 31 ms 896 KB Output is correct
39 Correct 31 ms 896 KB Output is correct
40 Correct 30 ms 896 KB Output is correct
41 Correct 29 ms 1016 KB Output is correct
42 Correct 42 ms 896 KB Output is correct
43 Correct 42 ms 912 KB Output is correct
44 Correct 37 ms 896 KB Output is correct
45 Correct 36 ms 896 KB Output is correct
46 Correct 23 ms 896 KB Output is correct
47 Correct 9 ms 384 KB Output is correct
48 Correct 23 ms 1144 KB Output is correct
49 Correct 11 ms 512 KB Output is correct
50 Correct 21 ms 768 KB Output is correct
51 Correct 17 ms 896 KB Output is correct
52 Correct 6 ms 384 KB Output is correct
53 Correct 15 ms 768 KB Output is correct
54 Correct 87 ms 896 KB Output is correct
55 Correct 92 ms 896 KB Output is correct
56 Correct 88 ms 896 KB Output is correct
57 Correct 71 ms 1016 KB Output is correct