Submission #747795

#	Time	Username	Problem	Language	Result	Execution time	Memory
747795		Rafi22	Packing Biscuits (IOI20_biscuits)	C++14	9 / 100	1102 ms	788496 KiB

biscuits

#include <bits/stdc++.h>

using namespace std;

#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define ll long long
ll mod=1000000007;
int inf=1000000007;
ll infl=1000000000000000007;

ll P[67];

ll count_tastiness(ll x, vector<ll>w)
{
    int k=sz(w);
    P[0]=w[0];
    for(int i=1;i<60;i++)
    {
        P[i]=P[i-1];
        if(i<k) P[i]+=w[i]*(1LL<<i);
    }
    for(int i=0;i<60;i++) P[i]/=x;
    vector<ll>V;
    V.pb(0);
    for(int i=0;i<60;i++)
    {
        vector<ll>nV;
        for(auto a:V)
        {
            ll A=a+(1LL<<i);
            if(P[i]<A) break;
            nV.pb(A);
        }
        for(auto z:nV) V.pb(z);
    }
    return sz(V);
}

/*int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int tt;
    cin>>tt;
    while(tt--)
    {
        int n;
        ll x;
        cin>>n>>x;
        vector<ll>a(n);
        for(int i=0;i<n;i++) cin>>a[i];
        cout<<count_tastiness(x,a)<<endl;
    }

    return 0;
}*/

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