Submission #921451

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