# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
617813 | someone | Packing Biscuits (IOI20_biscuits) | C++14 | 1 ms | 340 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 <bits/stdc++.h>
using namespace std;
const int N = 62;
int nb[N];
long long count_tastiness(long long x, std::vector<long long> a) {
int k = a.size();
for(int i = 0; i < N; i++)
nb[i] = 0;
for(int i = 0; i < k; i++)
nb[i] = a[i];
for(int i = 0; i < N-1; i++) {
if(nb[i] > x + 1) {
int add = (nb[i] - x) / 2;
nb[i+1] += add;
nb[i] -= 2 * add;
}
}
if(x == 1) {
long long ans = 1, sum = 0;
for(int i = N-1; i > -1; i--) {
if(nb[i] == 0) {
ans *= sum + 1;
sum = 0;
} else {
sum = 2 * sum + nb[i];
}
}
ans *= sum + 1;
return ans;
}
return -1;
}
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... |