Submission #720327

#	Time	Username	Problem	Language	Result	Execution time	Memory
720327		baojiaopisu	Packing Biscuits (IOI20_biscuits)	C++14	0 / 100	1078 ms	340 KiB

biscuits

#include<bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;
using ull = unsigned long long;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;

#define fi first
#define se second
#define left BAO
#define right ANH
#define pb push_back
#define pf push_front
#define mp make_pair
#define ins insert
#define btpc __builtin_popcount
#define btclz __builtin_clz

#define sz(x) (int)(x.size());
#define all(x) x.begin(), x.end()
#define debug(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int d4x[4] = {1, 0, -1, 0}; int d4y[4] = {0, 1, 0, -1};
int d8x[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int d8y[8] = {1, 1, 0, -1, -1, -1, 0, 1};

template<class X, class Y>
    bool minimize(X &x, const Y &y) {
        if (x > y)
        {
            x = y;
            return true;
        }
        return false;
    }
template<class X, class Y>
    bool maximize(X &x, const Y &y) {
        if (x < y)
        {
            x = y;
            return true;
        }
        return false;
    }

const int MOD = 1e9 + 7; //998244353

template<class X, class Y>
	void add(X &x, const Y &y) {
		x = (x + y);
		if(x >= MOD) x -= MOD;
	}

template<class X, class Y> 
	void sub(X &x, const Y &y) {
		x = (x - y);
		if(x < 0) x += MOD;
	}

/* Author : Le Ngoc Bao Anh, 12A5, LQD High School for Gifted Student*/

const ll INF = 1e9;
const int N = 1e5 + 10;

ll dp[105][105];

ll count_tastiness(ll x, vector<ll> a) {
    if(x == 1) {
        for(int i = 0; i + 1 < a.size(); i++) {
            ll x = (a[i] - 1) / 2;
            a[i + 1] += x;
            a[i] -= x * 2;
        }

        int n = a.size();
        for(int i = 0; i <= n; i++) {
            for(int j = 0; j <= n; j++) dp[i][j] = 0;
        }
        dp[n][n] = 1;
        for(int i = n; i >= 1; i--) {
            for(int j = i; j <= n; j++) {
                if(dp[i][j] == 0) continue;
                dp[i - 1][i - 1] += dp[i][j] * min(a[i - 1], (j < n ? ((1ll << (j - i + 1))) : INF));
                if(a[i - 1] == 0) dp[i - 1][n] += dp[i][j];
                if(a[i - 1] == 1) dp[i - 1][j] += dp[i][j];
                if(a[i - 1] == 2 && j == n) dp[i - 1][n] += dp[i][j];
            }
        }

        // for(int i = 0; i <= n; i++) {
        //     for(int j = 0; j <= n; j++) {
        //         if(dp[i][j] > 0) cout << i << " " << j << " " << dp[i][j] << '\n';
        //     }
        // }
        ll ans = 0;
        for(int i = 0; i <= n; i++) ans += dp[0][i];
        return ans;
    }

    ll sum = 0;
    for(int i = 0; i < a.size(); i++) {
        sum += (1ll << i) * a[i];
    }

    ll ans = 1;
    for(int i = 1; i * x <= sum; i++) {
        vector<ll> b = a;
        bool ok = true;
        for(int j = 1; j <= x; j++) {
            int t = i;
            for(int k = b.size() - 1; k >= 0; k--) {
                int p = min(b[k], 1ll * t / (1 << k));
                b[k] -= p;
                t -= (1 << k) * p;
            }
            if(t != 0) ok = false;
        }
        if(ok)  ++ans;
    }

    return ans;
}

Compilation message (stderr)

biscuits.cpp: In function 'll count_tastiness(ll, std::vector<long long int>)':
biscuits.cpp:76:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   76 |         for(int i = 0; i + 1 < a.size(); i++) {
      |                        ~~~~~~^~~~~~~~~~
biscuits.cpp:108:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  108 |     for(int i = 0; i < a.size(); i++) {
      |                    ~~^~~~~~~~~~

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