Submission #1230036

#	Time	Username	Problem	Language	Result	Execution time	Memory
1230036		a4n_	Packing Biscuits (IOI20_biscuits)	C++20	0 / 100	1095 ms	328 KiB

biscuits

#include <bits/stdc++.h>
#include "biscuits.h"
 
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
 
#define F first
#define S second
#define endl '\n'
#define Mp make_pair
#define pb push_back
#define pf push_front
#define size(x) (ll)x.size()
#define all(x) x.begin(), x.end()
#define fuck(x) cout<<"("<<#x<<" : "<<x<<")\n"
 
const int N = 3e5 + 100, lg = 18;
const ll Mod = 1e9 + 7;
const ll inf = 1e18 + 10;
 
ll MOD(ll a, ll mod=Mod) {
    a%=mod; (a<0)&&(a+=mod); return a;
}
ll poww(ll a, ll b, ll mod=Mod) {
    ll res = 1;
    while(b > 0) {
        if(b%2 == 1) res = MOD(res * a, mod);
        b /= 2;
        a = MOD(a * a, mod);
    }
    return res;
}
 
ll t, x, n, cnt[N], a[N];
long long count_tastiness(long long _x, vector<long long> _a) {
    x = _x, n = size(_a);
    ll sum = 0;
    for(int i=0; i<n; i++) a[i] = _a[i], sum += (a[i] * (1ll << i));

    ll ans = 0;
    for(ll y = 0; y*x <= sum; y ++) {
        for(int i=0; i<n; i++) cnt[i] = a[i];

        int num = x;
        while(num > 0) {
            ll fff = y;
            for(ll i=n-1; i>=0; i--) {
                ll z = min(cnt[i], fff / (1ll << i));
                cnt[i] -= z;
                fff -= (z * (1ll << i));
            }
            if(fff != 0) break;
            num --;
        }
        ans += (num == 0);
    }

    return ans;
}

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