oj.uz

Submission #540722

# Submission time Handle Problem Language Result Execution time Memory
540722 2022-03-21T13:53:00 Z alextodoran Packing Biscuits (IOI20_biscuits) C++17
100 / 100
 40 ms 832 KB 
/**
 ____ ____ ____ ____ ____
||a |||t |||o |||d |||o ||
||__|||__|||__|||__|||__||
|/__\|/__\|/__\|/__\|/__\|

**/

#include <bits/stdc++.h>
#include "biscuits.h"

using namespace std;

typedef long long ll;

ll x;
vector <ll> s;

unordered_map <ll, ll> save;

ll solve (ll n) {
    if (n <= 0) {
        return 0;
    } else if (n == 1) {
        return 1;
    } else {
        if (save.find(n) == save.end()) {
            int l = 0;
            while (((ll) 1 << (l + 1)) < n) {
                l++;
            }
            save[n] = solve(((ll) 1 << l)) + solve(min(n, 1 + s[l] / x) - ((ll) 1 << l));
        }
        return save[n];
    }
}

ll count_tastiness (ll _x, vector <ll> a) {
    while ((int) a.size() < 60) {
        a.push_back(0);
    }
    s.clear();
    save.clear();
    x = _x;
    for (int i = 0; i < (int) a.size(); i++) {
        s.push_back((s.empty() == false ? s.back() : 0) + (a[i] << i));
    }
    return solve((ll) 1 << 60);
}

Subtask #1
9.0 / 9.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 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 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 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 284 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 0 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

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 0 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 1 ms 212 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 368 KB Output is correct
2 Correct 18 ms 828 KB Output is correct
3 Correct 18 ms 724 KB Output is correct
4 Correct 19 ms 828 KB Output is correct
5 Correct 20 ms 724 KB Output is correct
6 Correct 25 ms 832 KB Output is correct
7 Correct 28 ms 820 KB Output is correct
8 Correct 20 ms 828 KB Output is correct
9 Correct 19 ms 828 KB Output is correct
10 Correct 20 ms 828 KB Output is correct

Subtask #5
23.0 / 23.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 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 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 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 284 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 0 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 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 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 0 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 1 ms 212 KB Output is correct
37 Correct 13 ms 368 KB Output is correct
38 Correct 18 ms 828 KB Output is correct
39 Correct 18 ms 724 KB Output is correct
40 Correct 19 ms 828 KB Output is correct
41 Correct 20 ms 724 KB Output is correct
42 Correct 25 ms 832 KB Output is correct
43 Correct 28 ms 820 KB Output is correct
44 Correct 20 ms 828 KB Output is correct
45 Correct 19 ms 828 KB Output is correct
46 Correct 20 ms 828 KB Output is correct
47 Correct 11 ms 372 KB Output is correct
48 Correct 23 ms 824 KB Output is correct
49 Correct 13 ms 372 KB Output is correct
50 Correct 27 ms 724 KB Output is correct
51 Correct 14 ms 724 KB Output is correct
52 Correct 12 ms 372 KB Output is correct
53 Correct 14 ms 724 KB Output is correct
54 Correct 38 ms 824 KB Output is correct
55 Correct 33 ms 832 KB Output is correct
56 Correct 40 ms 824 KB Output is correct
57 Correct 27 ms 832 KB Output is correct