Submission #921391

#TimeUsernameProblemLanguageResultExecution timeMemory
921391ksujay2Packing Biscuits (IOI20_biscuits)C++17
9 / 100
1068 ms600 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; ll count_tastiness(ll x, vector<ll> a) { a.resize(20); function<ll(int, ll)> f = [&] (int i, ll y) { if(i < 0) return (ll)(y == 0); y -= a[i] * (1LL << i); return f(i - 1, max(0ll, y)) + ((x < (1LL << (60 - i))) ? f(i - 1, max(0ll, y + x * (1LL << i))) : 0); }; return f(19, 0); }
#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...