Submission #769740

#	Time	Username	Problem	Language	Result	Execution time	Memory
769740		boris_mihov	Packing Biscuits (IOI20_biscuits)	C++17	42 / 100	1077 ms	38224 KiB

biscuits

#include "biscuits.h"
#include <unordered_map>
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>

typedef long long llong;
const int MAXN = 64;
const int INF = 1e9;

int n;
llong x;
llong a[MAXN];
std::unordered_map <llong, llong> mem[MAXN];

llong rec(int pos, llong prenos)
{
    if (pos == n)
    {
        return prenos / x + 1;
    }

    if (mem[pos].count(prenos))
    {
        return mem[pos][prenos];
    }

    llong ans = 0;
    llong curr = a[pos] + prenos;
    if (curr >= x) ans += rec(pos + 1, (curr - x) / 2);
    ans += rec(pos + 1, curr / 2);
    return mem[pos][prenos] = ans;
}

llong count_tastiness(llong X, std::vector <llong> A)
{
    n = A.size();
    x = X;

    for (int i = 0 ; i < n ; ++i)
    {
        a[i] = A[i];
        mem[i].clear();
    }

	return rec(0, 0);
}

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