# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
834135 | faruk | Packing Biscuits (IOI20_biscuits) | C++17 | 1045 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>
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
const ll maxsum = 1e5+1;
const ll maxsiz = 71;
long long count_tastiness(long long x, std::vector<long long> a) {
if (x == 1) {
ll out = 1;
a.resize(maxsiz);
for (int i = 0; i < a.size()-1; i++) {
ll to_remove = 0;
if (a[i] % 2)
to_remove = a[i] - 1LL;
else if (a[i] > 0)
to_remove = a[i] - 2LL;
a[i + 1] += to_remove / 2LL;
a[i] -= to_remove;
}
ll has_l = 0, hasnt_l = 1;
for (int i = 0; i < a.size(); i++) {
if (a[i] == 0) {
out *= has_l + hasnt_l;
has_l = 0, hasnt_l = 1;
} else {
has_l *= 2LL;
if (a[i] == 2)
has_l++;
hasnt_l *= 2LL;
}
}
return out;
}
//x = 1;
ll out = 0;
a.resize(61);
for (int val = 0; val < maxsum; val++) {
vector<ll> curr = a;
int num = 0;
bool ok = true;
for (ll a = 0; a < curr.size(); a++) {
num += curr[a];
if ((val & (1LL <<a)) != 0)
{
if (num < x)
ok = false;
else
num -= x;
}
num /= 2;
}
if (ok)
out++;
}
return out;
}
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... |