Submission #436281

#	Time	Username	Problem	Language	Result	Execution time	Memory
436281		yuto1115	Packing Biscuits (IOI20_biscuits)	C++17	33 / 100	72 ms	5180 KiB

biscuits

#include "biscuits.h"
#include "bits/stdc++.h"
#define rep(i, n) for(ll i = 0; i < ll(n); i++)
#define rep2(i, s, n) for(ll i = ll(s); i < ll(n); i++)
#define rrep(i, n) for(ll i = ll(n)-1; i >= 0; i--)
#define pb push_back
#define eb emplace_back
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vp = vector<P>;
using vvp = vector<vp>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vs = vector<string>;

template<class T>
bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

ll count_tastiness(ll x, vl a) {
    int k = 60;
    while (a.size() < k) a.pb(0);
    rep(i, k) {
        if (a[i] > x) {
            ll l = (a[i] - x) / 2;
            a[i] -= l * 2;
            a[i + 1] += l;
        }
    }
    if (x <= 10000) {
        int mx = x + 10;
        vvl dp(k + 1, vl(mx));
        dp[0][0] = 1;
        rep(i, k) rep(j, mx) {
                ll now = dp[i][j];
                if (!now) continue;
                dp[i + 1][(j + a[i]) / 2] += now;
                if (j + a[i] >= x) dp[i + 1][(j + a[i] - x) / 2] += now;
            }
        rep2(i, 1, mx) assert(dp[k][i] == 0);
        return dp[k][0];
    } else {
        assert(false);
    }
}

Compilation message (stderr)

biscuits.cpp: In function 'll count_tastiness(ll, vl)':
biscuits.cpp:43:21: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   43 |     while (a.size() < k) a.pb(0);
      |            ~~~~~~~~~^~~

• Subtask 1: 0 / 9
• Subtask 2: 12 / 12
• Subtask 3: 21 / 21
• Subtask 4: 0 / 35
• Subtask 5: 0 / 23