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;
#include "biscuits.h"
#define int long long
long long count_tastiness(long long x, std::vector<long long> a) {
a.resize(a.size() + 65, 0); int k = a.size();
vector s(k,0ll);
s[0] = a[0];
for (int i = 1; i < k; i++) {
s[i] = s[i - 1] + a[i] * (1<<i);
}
vector<int> good = {0};
for (int i=0; i<25; i++) {
int nw = good.size();
for (int j=0; j<nw; j++) {
if ((good[j]+(1<<i)) * x <= s[i]) good.push_back(good[j] + (1<<i));
else break;
}
}
return good.size();
}
# | 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... |