oj.uz

Submission #579747

# Submission time Handle Problem Language Result Execution time Memory
579747 2022-06-19T18:04:49 Z SlavicG Packing Biscuits (IOI20_biscuits) C++17
100 / 100
 90 ms 1336 KB 
#include "biscuits.h"
#include "bits/stdc++.h"

#define ll long long
std::map<ll, ll> dp;

const int K = 62;
ll s[K];
ll rec(ll n, ll x) {
    if(n <= 0) return 0;
    if(n == 1) return 1;
    if(dp.count(n)) return dp[n];
    ll largestSmaller = 0;
    for(ll i = 0; i < K; ++i) {
        if((1LL << i) < n) largestSmaller = i;
    }

    ll ans = rec((1LL << largestSmaller), x) + rec(std::min(n, 1 + s[largestSmaller] / x) - (1LL << largestSmaller), x);
    dp[n] = ans;
    return ans;

}
long long count_tastiness(long long x, std::vector<long long> a) {
    dp.clear();
    for(ll i = 0; i < K; ++i) s[i] = 0;
    for(ll i = 0; i < (ll)a.size(); ++i) {
        s[i] = a[i] * (1LL << i);
        if(i) s[i] += s[i - 1];
    }
    for(ll i = (ll)a.size(); i < K; ++i) s[i] = s[i - 1];
    if(s[(ll)a.size() - 1] < x) return 1;
    return rec((s[(ll)a.size() - 1]) / x + 1, x);
}

Subtask #1
9.0 / 9.0

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

Subtask #3
21.0 / 21.0

# 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 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 212 KB Output is correct
13 Correct 2 ms 212 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 340 KB Output is correct
2 Correct 25 ms 820 KB Output is correct
3 Correct 25 ms 832 KB Output is correct
4 Correct 23 ms 724 KB Output is correct
5 Correct 23 ms 724 KB Output is correct
6 Correct 32 ms 812 KB Output is correct
7 Correct 31 ms 832 KB Output is correct
8 Correct 28 ms 808 KB Output is correct
9 Correct 29 ms 808 KB Output is correct
10 Correct 18 ms 724 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 304 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 292 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 296 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 308 KB Output is correct
21 Correct 1 ms 296 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 304 KB Output is correct
24 Correct 1 ms 212 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 212 KB Output is correct
28 Correct 1 ms 212 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 212 KB Output is correct
36 Correct 2 ms 212 KB Output is correct
37 Correct 5 ms 340 KB Output is correct
38 Correct 25 ms 820 KB Output is correct
39 Correct 25 ms 832 KB Output is correct
40 Correct 23 ms 724 KB Output is correct
41 Correct 23 ms 724 KB Output is correct
42 Correct 32 ms 812 KB Output is correct
43 Correct 31 ms 832 KB Output is correct
44 Correct 28 ms 808 KB Output is correct
45 Correct 29 ms 808 KB Output is correct
46 Correct 18 ms 724 KB Output is correct
47 Correct 8 ms 340 KB Output is correct
48 Correct 25 ms 1324 KB Output is correct
49 Correct 13 ms 404 KB Output is correct
50 Correct 23 ms 1076 KB Output is correct
51 Correct 10 ms 1336 KB Output is correct
52 Correct 2 ms 428 KB Output is correct
53 Correct 11 ms 1076 KB Output is correct
54 Correct 90 ms 1176 KB Output is correct
55 Correct 81 ms 1180 KB Output is correct
56 Correct 72 ms 1200 KB Output is correct
57 Correct 59 ms 1208 KB Output is correct