Submission #1065762

#	Time	Username	Problem	Language	Result	Execution time	Memory
1065762		vjudge1	Packing Biscuits (IOI20_biscuits)	C++17	0 / 100	1 ms	348 KiB

biscuits

#include "biscuits.h"
#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using vll = vector<ll>;
using i128 = __int128;

ll count_tastiness(ll x, vll a) {
    int n = int(a.size());
    vector<i128> S(n, 0);
    for(int i = 0; i < n; ++i) {
        S[i] = i128(1ll << i) * a[i];
        if(i) S[i] += S[i - 1];
        S[i] = min(S[i], x * i128(1ll << (i + 1)) - 1);
    }
    vll C(n, 0);
    for(int i = 0; i < n; ++i) {
        S[i] /= x;
        if(S[i] >= i128(1ll << (i + 1)) - 1) C[i] = (1ll << (i + 1)) - 1;
        else C[i] = ll(S[i]);
    }
    int re = 0;
    const ll MV = 100003;
    for(int i = 0; i < min(MV, 1ll << n); ++i) {
        ll v = 0;
        int ok = 1;
        for(int j = 0; j < n; ++j) {
            if(i & (1ll << j)) v |= (1ll << j);
            if(v > S[j]) {
                ok = 0;
                break;
            }
        }
        re += ok;
    }
	return re;
}

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