This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using ll = long long;
using pi = pair<int,int>;
#define ST first
#define ND second
#define PB push_back
ll count_tastiness(ll x, vector<ll>a) {
ll sum = 0;
for(int i = 0; i < (int)a.size(); ++i) {
sum += (1LL << i) * a[i];
}
while((int)a.size() < 20) a.PB(0);
ll res = 0;
for(ll i = 0; i <= sum; ++i) {
ll cur = 0;
bool ok = 1;
for(int j = 0; j < 20; ++j) {
cur += a[j];
if(i & (1 << j)) {
if(cur < x) {
ok = 0;
break;
}
cur -= x;
}
cur /= 2;
}
res += ok;
}
return res;
}
//int main() {
// cout << count_tastiness(2, {2, 1, 2});
//}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |