oj.uz

Submission #366209

# Submission time Handle Problem Language Result Execution time Memory
366209 2021-02-13T13:49:35 Z dolphingarlic Packing Biscuits (IOI20_biscuits) C++14
100 / 100
 78 ms 1004 KB 
#include "biscuits.h"

#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

ll x, s[60];
map<ll, ll> dp;

ll solve(ll n) {
	if (n <= 0) return 0;
	if (dp.count(n)) return dp[n];
	for (int i = 0; i < 60; i++) if ((1ll << i + 1) >= n)
		return dp[n] = solve(1ll << i) + solve(min(n, 1 + s[i] / x) - (1ll << i));
}

ll count_tastiness(ll x, vector<ll> a) {
	a.resize(60), ::x = x;
	s[0] = a[0];
	for (int i = 1; i < 60; i++) s[i] = s[i - 1] + (1ll << i) * a[i];
	dp.clear();
	dp[1] = 1;
	return solve(1ll << 60);
}

Compilation message

biscuits.cpp: In function 'll solve(ll)':
biscuits.cpp:13:45: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
   13 |  for (int i = 0; i < 60; i++) if ((1ll << i + 1) >= n)
      |                                           ~~^~~
biscuits.cpp:15:1: warning: control reaches end of non-void function [-Wreturn-type]
   15 | }
      | ^

Subtask #1
9.0 / 9.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 364 KB Output is correct
2 Correct 30 ms 876 KB Output is correct
3 Correct 26 ms 876 KB Output is correct
4 Correct 26 ms 876 KB Output is correct
5 Correct 30 ms 876 KB Output is correct
6 Correct 39 ms 876 KB Output is correct
7 Correct 31 ms 1004 KB Output is correct
8 Correct 28 ms 876 KB Output is correct
9 Correct 28 ms 876 KB Output is correct
10 Correct 21 ms 876 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 376 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 492 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 9 ms 364 KB Output is correct
38 Correct 30 ms 876 KB Output is correct
39 Correct 26 ms 876 KB Output is correct
40 Correct 26 ms 876 KB Output is correct
41 Correct 30 ms 876 KB Output is correct
42 Correct 39 ms 876 KB Output is correct
43 Correct 31 ms 1004 KB Output is correct
44 Correct 28 ms 876 KB Output is correct
45 Correct 28 ms 876 KB Output is correct
46 Correct 21 ms 876 KB Output is correct
47 Correct 12 ms 364 KB Output is correct
48 Correct 23 ms 876 KB Output is correct
49 Correct 13 ms 364 KB Output is correct
50 Correct 21 ms 748 KB Output is correct
51 Correct 17 ms 900 KB Output is correct
52 Correct 8 ms 364 KB Output is correct
53 Correct 15 ms 748 KB Output is correct
54 Correct 78 ms 1004 KB Output is correct
55 Correct 70 ms 876 KB Output is correct
56 Correct 62 ms 876 KB Output is correct
57 Correct 52 ms 876 KB Output is correct