oj.uz

Submission #934065

# Submission time Handle Problem Language Result Execution time Memory
934065 2024-02-26T18:33:00 Z EJIC_B_KEDAX Packing Biscuits (IOI20_biscuits) C++17
100 / 100
 12 ms 1384 KB 
#include <bits/stdc++.h>

using ll = long long;

using namespace std;

mt19937 mt(time(nullptr));

vector<ll> tmp, origin, dp;

ll calc(ll x, int pos) {
    ll sum = (1ll << pos) * tmp[pos];
    int ptr = pos;
    while (ptr > 0 && sum < (__int128)1 * (1ll << pos) * x) {
        sum += (1ll << ptr) * tmp[--ptr];
    }
    if (sum < (__int128)1 * (1ll << pos) * x) {
        // cout << "! " << pos << '\n';
        return (pos ? dp[pos - 1] : 1);
    }
    if (ptr == pos) {
        // cout << "!! " << pos << '\n';
        if (ptr == 0) {
            return 2;
        } else {
            return 2 * dp[pos - 1];
        }
    }
    tmp[ptr] = (sum - (__int128)1 * (1ll << pos) * x) / (1ll << ptr);
    ll res = calc(x, ptr);
    // cout << pos << ' ' << ptr << ' ' << res << '\n';
    tmp[ptr] = origin[ptr];
    return res + dp[pos - 1];
}

ll count_tastiness(ll x, vector<ll> a) {
    while (a.size() < 60) {
        a.push_back(0);
    }
    int n = 60;
    for (int i = 0; i < n; i++) {
        if (a[i] > x + 1) {
            a[i + 1] += (a[i] - x) / 2;
            a[i] -= ((a[i] - x) / 2) * 2;
        }
    }
    origin = a;
    tmp.resize(n);
    tmp = a;
    dp.resize(n, 0);
    for (int i = 0; i < n; i++) {
        dp[i] = calc(x, i);
        // cout << dp[i] << '\n';
    }
    // cout << '\n';
    return dp[n - 1];
}

Compilation message

biscuits.cpp: In function 'll calc(ll, int)':
biscuits.cpp:15:35: warning: operation on 'ptr' may be undefined [-Wsequence-point]
   15 |         sum += (1ll << ptr) * tmp[--ptr];
      |                                   ^~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 404 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct

Subtask #3
21.0 / 21.0

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

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 544 KB Output is correct
2 Correct 8 ms 1116 KB Output is correct
3 Correct 8 ms 1116 KB Output is correct
4 Correct 8 ms 1252 KB Output is correct
5 Correct 8 ms 1116 KB Output is correct
6 Correct 8 ms 1116 KB Output is correct
7 Correct 8 ms 1112 KB Output is correct
8 Correct 8 ms 1384 KB Output is correct
9 Correct 8 ms 1304 KB Output is correct
10 Correct 7 ms 1116 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 448 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 404 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 3 ms 544 KB Output is correct
38 Correct 8 ms 1116 KB Output is correct
39 Correct 8 ms 1116 KB Output is correct
40 Correct 8 ms 1252 KB Output is correct
41 Correct 8 ms 1116 KB Output is correct
42 Correct 8 ms 1116 KB Output is correct
43 Correct 8 ms 1112 KB Output is correct
44 Correct 8 ms 1384 KB Output is correct
45 Correct 8 ms 1304 KB Output is correct
46 Correct 7 ms 1116 KB Output is correct
47 Correct 3 ms 348 KB Output is correct
48 Correct 7 ms 1372 KB Output is correct
49 Correct 4 ms 604 KB Output is correct
50 Correct 7 ms 1116 KB Output is correct
51 Correct 9 ms 1372 KB Output is correct
52 Correct 3 ms 448 KB Output is correct
53 Correct 7 ms 1116 KB Output is correct
54 Correct 11 ms 1116 KB Output is correct
55 Correct 12 ms 1324 KB Output is correct
56 Correct 11 ms 1232 KB Output is correct
57 Correct 11 ms 1352 KB Output is correct