Submission #834117

#	Time	Username	Problem	Language	Result	Execution time	Memory
834117		finn__	Packing Biscuits (IOI20_biscuits)	C++17	0 / 100	1 ms	468 KiB

biscuits

#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,sse4")

#include "biscuits.h"
#include <memory.h>

using L = long long;

constexpr int N = 128;

size_t l;
L b[N][2], x;

int dfs(size_t i = 0, L z = 0)
{
    if (i == l - 1)
        return 1 + (b[i][1] + z >= x);
    int ans = dfs(i + 1, (b[i][1] + z) >> (b[i + 1][0] - b[i][0]));
    if (b[i][1] + z >= x)
        ans += dfs(i + 1, (b[i][1] + z - x) >> (b[i + 1][0] - b[i][0]));
    return ans;
}

L count_tastiness(L x_, std::vector<L> a)
{
    x = x_;
    l = 0;
    for (size_t i = 0; i < a.size(); ++i)
        if (a[i])
            b[l][0] = i, b[l][1] = a[i], ++l;
    return dfs();
}

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