Submission #1066371

#	Time	Username	Problem	Language	Result	Execution time	Memory
1066371		Kipras	Packing Biscuits (IOI20_biscuits)	C++17	0 / 100	1046 ms	416 KiB

biscuits

#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

constexpr ll maxLog = 62;

ll count_tastiness(ll x, vector<ll> a) {

    ll res = 1;

    for(ll y = 1; y <= 200000; y++) {
        vector<bool> bits;
        ll latestBit = 0;
        for(ll i = 0; i < maxLog; i++) {
            if(y&(1ll<<i)) {
                latestBit=i;
            }
        }
        vector<ll> b;
        for(auto i : a)b.push_back(i);
        for(int i = a.size(); i <= 61; i++)b.push_back(0);

        bool pos = true;
        for(ll i = latestBit; i >= 0; i--) {
            if(y&(1<<i)) {
                ll need = x;
                need = max(0ll, need-b[i]);
                if(need==0)continue;
                else {
                    for(ll z = i-1; z >= 0; z--) {
                        need*=2;
                        ll mn = min(need, b[z]);
                        need-=mn;
                        b[z]-=mn;
                        if(need==0)break;
                    }
                    if(need!=0) {
                        pos=false;
                        break;
                    }
                }
            }
        }
        if(pos)res++;
    }

    return res;
}

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