Submission #1270282

#	Time	Username	Problem	Language	Result	Execution time	Memory
1270282		AlgorithmWarrior	Packing Biscuits (IOI20_biscuits)	C++20	9 / 100	1096 ms	840 KiB

biscuits

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

using namespace std;

long long count_tastiness(long long x,vector<long long>a){
    long long y;
    int cnt=0;
    long long sum=0;
    int i;
    int k=a.size();
    for(i=0;i<k;++i)
        sum+=a[i]*(1LL<<i);
    for(y=0;x*y<=sum;++y){
        long long debt=0;
        for(i=k-1;i>=0;--i){
            if(y&(1LL<<i))
                debt+=x*(1LL<<i);
            debt-=a[i]*(1LL<<i);
            if(debt<0)
                debt=0;
        }
        if(debt==0)
            ++cnt;
    }
    return cnt;
}

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