제출 #834039

#제출 시각아이디문제언어결과실행 시간메모리
834039finn__비스킷 담기 (IOI20_biscuits)C++17
0 / 100
1063 ms300 KiB
#include "biscuits.h"

using L = long long;

constexpr int N = 128;

L a[N], x;

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

L count_tastiness(L x_, std::vector<L> a_)
{
    x = x_;
    copy(a_.begin(), a_.end(), a);
    return dfs();
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...