Submission #306118

#TimeUsernameProblemLanguageResultExecution timeMemory
306118MrDominoPacking Biscuits (IOI20_biscuits)C++14
0 / 100
1094 ms384 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; ll x; vector<ll> a; vector<ll> limit; int n; int sol; void bkt(int i, ll sum) { if (i == 60) { sol++; return; } if (sum <= limit[i]) { bkt(i + 1, sum); } if (sum + x * (1LL << i) <= limit[i]) { bkt(i + 1, sum + x * (1LL << i)); } } ll count_tastiness(ll xx, vector<ll> aa) { sol = 0; x = xx; a = aa; n = (int) a.size(); limit = a; ll c = 0; for (int i = 0; i < n; i++) { c += (1LL << i) * a[i]; limit[i] = c; } while ((int) limit.size() < 60) { limit.push_back(limit.back()); } bkt(0, 0); return sol; }
#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...