oj.uz

Submission #612583

# Submission time Handle Problem Language Result Execution time Memory
612583 2022-07-29T17:51:27 Z skittles1412 Packing Biscuits (IOI20_biscuits) C++17
100 / 100
 60 ms 852 KB 
#include "bits/extc++.h"

using namespace std;

template <typename T>
void dbgh(const T& t) {
    cerr << t << endl;
}

template <typename T, typename... U>
void dbgh(const T& t, const U&... u) {
    cerr << t << " | ";
    dbgh(u...);
}

#ifdef DEBUG
#define dbg(...)                                              \
    cerr << "L" << __LINE__ << " [" << #__VA_ARGS__ << "]: "; \
    dbgh(__VA_ARGS__);
#else
#define dbg(...)
#define cerr   \
    if (false) \
    cerr
#endif

using ll = long long;

#define endl "\n"
#define long int64_t
#define sz(x) int((x).size())

long k;
map<long, long> memo;
vector<long> arr, psum;

long dp(long x) {
    if (!x) {
        return 1;
    }
    auto [it, inserted] = memo.emplace(x, 0);
    if (!inserted) {
        return it->second;
    }
    int bit = __lg(x);
    long ans = dp((long(1) << bit) - 1);
    if ((psum[bit] >> bit) >= k) {
        ans += dp(min(x - (long(1) << bit), (psum[bit] - (k << bit)) / k));
    }
    return it->second = ans;
}

ll count_tastiness(ll _k, vector<ll> _arr) {
    k = _k;
    arr.clear();
    arr.resize(64);
    copy(begin(_arr), end(_arr), arr.begin());
    psum.resize(64);
    long cpsum = 0;
    for (int i = 0; i < 64; i++) {
        psum[i] = cpsum += arr[i] << i;
    }
    memo.clear();
    dbg(dp(0), dp(1), dp(2), dp(3), dp(4), dp(5), dp(6));
    return dp(long(1) << 62);
}

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

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 320 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 9 ms 340 KB Output is correct
2 Correct 18 ms 824 KB Output is correct
3 Correct 19 ms 724 KB Output is correct
4 Correct 18 ms 824 KB Output is correct
5 Correct 19 ms 724 KB Output is correct
6 Correct 28 ms 828 KB Output is correct
7 Correct 23 ms 736 KB Output is correct
8 Correct 22 ms 724 KB Output is correct
9 Correct 21 ms 840 KB Output is correct
10 Correct 15 ms 824 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 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 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 212 KB Output is correct
9 Correct 0 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 0 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 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 0 ms 212 KB Output is correct
21 Correct 0 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 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 320 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 9 ms 340 KB Output is correct
38 Correct 18 ms 824 KB Output is correct
39 Correct 19 ms 724 KB Output is correct
40 Correct 18 ms 824 KB Output is correct
41 Correct 19 ms 724 KB Output is correct
42 Correct 28 ms 828 KB Output is correct
43 Correct 23 ms 736 KB Output is correct
44 Correct 22 ms 724 KB Output is correct
45 Correct 21 ms 840 KB Output is correct
46 Correct 15 ms 824 KB Output is correct
47 Correct 7 ms 340 KB Output is correct
48 Correct 19 ms 824 KB Output is correct
49 Correct 11 ms 340 KB Output is correct
50 Correct 21 ms 724 KB Output is correct
51 Correct 13 ms 820 KB Output is correct
52 Correct 6 ms 340 KB Output is correct
53 Correct 10 ms 724 KB Output is correct
54 Correct 60 ms 840 KB Output is correct
55 Correct 50 ms 852 KB Output is correct
56 Correct 42 ms 820 KB Output is correct
57 Correct 37 ms 832 KB Output is correct