oj.uz

Submission #934058

# Submission time Handle Problem Language Result Execution time Memory
934058 2024-02-26T18:20:51 Z EJIC_B_KEDAX Packing Biscuits (IOI20_biscuits) C++17
0 / 100
 2 ms 348 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 < (1ll << pos) * x) {
        sum += (1ll << ptr) * tmp[--ptr];
    }
    if (sum < (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 - (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;
        }
    }
    origin = a;
    tmp.resize(n);
    tmp = a;
    dp.resize(n, 0);
    for (int i = 0; i < n; i++) {
        dp[i] = calc(x, i);
    }
    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
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -