Submission #432147

#	Time	Username	Problem	Language	Result	Execution time	Memory
432147		Ozy	Packing Biscuits (IOI20_biscuits)	C++17	0 / 100	2 ms	332 KiB

biscuits

#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define rep(i,a,b) for(int i = (a); i <= (b); i++)
#define repa(i,a,b) for(int i = (a); i >= (b); i--)
#define debug(a) cout << #a << " = " << a << endl
#define debugsl(a) cout << #a << " = " << a << ", "

#define MAX 70

lli n,res,cant,sec,bloque;
lli pot[64];

void calcula() {
    pot[0] = 1;
    rep(i,1,63) pot[i] = pot[i-1]*2;
}

long long count_tastiness(long long x, std::vector<long long> a) {

	if (pot[0] == 0) calcula();


	n = a.size();
	rep(i,n,64) a.push_back(0);
	n = 64;

	cant = 0;
	res = 0;
	sec = 0;
	bloque = 0;

	if (x > 1) return 0;

	rep(i,0,n-1) {
        if (a[i] > 0) {

            cant++;
            bloque++;

            if (a[i]%2 == 0){
                a[i+1] += (a[i]-1)/2;
                sec++;
            }
            else a[i+1] += a[i]/2;
        }
        else if (bloque > 0){
            res += pot[sec] - 1;
            bloque = 0;
        }
	}

	res += (pot[cant]-1);
	res++;

	return res;
}

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