# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
425601 | idk321 | Packing Biscuits (IOI20_biscuits) | C++17 | 223 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 <bits/stdc++.h>;
using namespace std;
typedef long long ll;
long long count_tastiness(long long x, std::vector<long long> a) {
ll sum = 0;
int k = 60;
for (int i = 0; i < a.size(); i++)
{
sum += (1LL << i) * a[i];
}
if (sum <= 100000)
{
int res = 0;
for (int i = 0; i <= sum; i++)
{
bool poss = true;
vector<ll> cur(60);
for (int j = 0; j < a.size(); j++) cur[j] = a[j];
for (int j = 0; j < k; j++)
{
if ((1LL << j) & i)
{
cur[j] -= x;
if (cur[j] < 0)
{
poss = false;
break;
}
}
if (j + 1 < k)
{
cur[j + 1] += cur[j] / 2;
}
}
if (poss) res++;
}
return res;
}
if (x == 1)
{
vector<ll> cur(k);
for (int j = 0; j < a.size(); j++) cur[j] = a[j];
for (int j = 0; j < k - 1; j++)
{
if (cur[j] == 0) continue;
if (cur[j] % 2 == 0)
{
cur[j + 1] += (cur[j] - 2) / 2;
cur[j] = 2;
}
if (cur[j] % 2 == 1)
{
cur[j + 1] += cur[j] / 2;
cur[j] = 1;
}
}
ll res = 1;
for (int i = 0; i < k; i++)
{
for (int j = 0; j < cur[i]; j++)
{
res *= 2;
}
}
return res;
}
return 0;
}
/*
1
3 3
5 2 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... |