Submission #565419

#	Time	Username	Problem	Language	Result	Execution time	Memory
565419		2fat2code	Packing Biscuits (IOI20_biscuits)	C++17	0 / 100	2 ms	1420 KiB

biscuits

#include "biscuits.h"
#include <bits/stdc++.h>
#define fr first
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define sc second
#define all(s) s.begin(), s.end()
#define int long long
using namespace std;

int ans = 1;

int count_tastiness(int x, vector<int> a) {
    ans = 1;
	int sum = 0;
	int nrbiti = (int)a.size();
	for(int i=0;i<nrbiti;i++){
        sum += a[i] * (1LL << i);
	}
	for(int curr=1;curr<=sum/x;curr++){
        vector<int>need(x + 1, 0);
        vector<int>b = a;
        b.push_back(0);
        for(int i=0;(1LL<<i)<=curr;i++){
            if(curr & (1LL<<i) && b[i] < x){
                goto next;
            }
            else{
                if(curr & (1LL << i)) b[i] -= x;
                b[i + 1] += (b[i] / 2);
            }
        }
        ++ans;
        next:;
	}
	return ans;
}

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