Submission #795754

#	Time	Username	Problem	Language	Result	Execution time	Memory
795754		alexander707070	Packing Biscuits (IOI20_biscuits)	C++14	0 / 100	1082 ms	340 KiB

biscuits

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

const long long mod=1e9+7;

long long x,sum,curr,mult;
int k,ans;
vector<long long> br;
bool dali;

long long count_tastiness(long long X,vector<long long> A){
    k=int(A.size()); x=X;
    br.resize(k); ans=0;

    for(int i=0;i<=100000/x;i++){
        for(int f=0;f<k;f++)br[f]=A[f];
        dali=true;

        for(int f=0;f<x;f++){
            curr=i;
            for(int t=k-1;t>=0;t--){
                mult=min(curr/(1LL<<t),br[t]);
                curr-=mult*(1LL<<t); br[t]-=mult;
            }
            if(curr!=0)dali=false;
        }

        if(dali)ans++;
    }

    return ans;
}

/*
int main(){
    cout<<count_tastiness(2, {2, 1, 2})<<"\n";
    cout<<count_tastiness(2, {2, 1, 2})<<"\n";
}
*/

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