oj.uz

Submission #310707

# Submission time Handle Problem Language Result Execution time Memory
310707 2020-10-07T16:30:26 Z apostoldaniel854 Packing Biscuits (IOI20_biscuits) C++17
100 / 100
 37 ms 1024 KB 
#include <bits/stdc++.h>

using namespace std;

#define pb push_back
using ll = long long;
using lll = __int128_t;
const int K = 60;
const ll INF = 1e18;


ll count_tastiness (ll _x, vector <ll> a) {
    a.resize (K);
    vector <lll> sum (1 + K);
    vector <lll> dp (1 + K);
    for (int i = 0; i < K; i++)
        sum[i + 1] = sum[i] + (a[i] << i);
    lll x = _x;
    dp[K] = 1;
    for (int i = K; i > 0; i--) {
        lll lb = sum[i], rb = sum[i];
        for (int j = i - 1; j >= 0; j--) {
            if (lb >= (x << j))
                lb -= (x << j);
            if (rb >= sum[j]) {
                if (lb <= rb)
                    dp[j] += dp[i] * (1 + (rb - max (lb, sum[j])) / (x << j));
                rb -= (1 + (rb - sum[j]) / (x << j)) * (x << j);
            }
        }
    }
    return dp[0];
}
/**
int main () {
    int n;
    ll x;
    cin >> n >> x;
    vector <ll> v;
    for (int i = 1; i <= n; i++) {
        ll val;
        cin >> val;
        v.pb (val);
    }
    cout << count_tastiness (x, v) << "\n";
    return 0;
}
**/

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 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 256 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 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 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 256 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 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 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 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 384 KB Output is correct
2 Correct 21 ms 888 KB Output is correct
3 Correct 21 ms 860 KB Output is correct
4 Correct 21 ms 888 KB Output is correct
5 Correct 21 ms 896 KB Output is correct
6 Correct 28 ms 892 KB Output is correct
7 Correct 22 ms 884 KB Output is correct
8 Correct 22 ms 896 KB Output is correct
9 Correct 22 ms 888 KB Output is correct
10 Correct 21 ms 896 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 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 256 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 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 1 ms 256 KB Output is correct
23 Correct 1 ms 256 KB Output is correct
24 Correct 1 ms 256 KB Output is correct
25 Correct 0 ms 256 KB Output is correct
26 Correct 1 ms 256 KB Output is correct
27 Correct 1 ms 256 KB Output is correct
28 Correct 1 ms 256 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 1 ms 256 KB Output is correct
31 Correct 1 ms 256 KB Output is correct
32 Correct 1 ms 256 KB Output is correct
33 Correct 1 ms 256 KB Output is correct
34 Correct 1 ms 256 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 1 ms 256 KB Output is correct
37 Correct 10 ms 384 KB Output is correct
38 Correct 21 ms 888 KB Output is correct
39 Correct 21 ms 860 KB Output is correct
40 Correct 21 ms 888 KB Output is correct
41 Correct 21 ms 896 KB Output is correct
42 Correct 28 ms 892 KB Output is correct
43 Correct 22 ms 884 KB Output is correct
44 Correct 22 ms 896 KB Output is correct
45 Correct 22 ms 888 KB Output is correct
46 Correct 21 ms 896 KB Output is correct
47 Correct 11 ms 384 KB Output is correct
48 Correct 37 ms 888 KB Output is correct
49 Correct 13 ms 384 KB Output is correct
50 Correct 35 ms 768 KB Output is correct
51 Correct 19 ms 896 KB Output is correct
52 Correct 9 ms 384 KB Output is correct
53 Correct 17 ms 768 KB Output is correct
54 Correct 25 ms 896 KB Output is correct
55 Correct 25 ms 1016 KB Output is correct
56 Correct 24 ms 896 KB Output is correct
57 Correct 23 ms 1024 KB Output is correct