# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
479991 | stefantaga | Packing Biscuits (IOI20_biscuits) | C++14 | 2 ms | 332 KiB |
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 "biscuits.h"
#include <cassert>
#include <cstdio>
using namespace std;
long long sum=0,cop[65];
long long count_tastiness(long long x, std::vector<long long> a) {
int k=a.size();
long long p=1,suma=0,lim,t,ok1,nr=0,i;
for (int i=0;i<k;i++)
{
suma=suma+p*a[i];
cop[i]=a[i];
p=p*2;
}
for (i=0;i<=60;i++)
{
if (cop[i]>0)
{
nr++;
cop[i]--;
}
cop[i+1]+=cop[i]/2;
}
p=1;
for (i=1;i<=nr;i++)
{
p=p*2;
}
return p;
}
#ifdef HOME
int main() {
int q;
assert(scanf("%d", &q) == 1);
vector<int> k(q);
vector<long long> x(q);
vector<vector<long long>> a(q);
vector<long long> results(q);
for (int t = 0; t < q; t++) {
assert(scanf("%d%lld", &k[t], &x[t]) == 2);
a[t] = vector<long long>(k[t]);
for (int i = 0; i < k[t]; i++) {
assert(scanf("%lld", &a[t][i]) == 1);
}
}
fclose(stdin);
for (int t = 0; t < q; t++) {
results[t] = count_tastiness(x[t], a[t]);
}
for (int t = 0; t < q; t++) {
printf("%lld\n", results[t]);
}
fclose(stdout);
return 0;
}
#endif // HOME
Compilation message (stderr)
# | 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... |