# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
805906 | LittleCube | Packing Biscuits (IOI20_biscuits) | C++17 | 1133 ms | 1235700 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 ll long long
using namespace std;
long long count_tastiness(ll x, vector<ll> a)
{
a.resize(60);
int k = 60;
vector<ll> sum(k), fold(k);
sum[0] = a[0];
for (int i = 1; i < k; i++)
sum[i] = sum[i - 1] + (a[i] << i);
for (int i = 0; i < k; i++)
if (sum[i] / x / (1LL << i) == 0)
fold[i] = -1;
else
fold[i] = min((1LL << i) - 1, (sum[i] - x * (1LL << i)) / x);
vector<ll> v;
v.reserve(400000);
v.emplace_back(0);
for (int i = 0; i < k; i++)
{
for (int j = 0; j < v.size(); j++)
if(v[j] <= fold[i])
v.emplace_back((1LL << i) + v[j]);
else break;
}
return v.size();
}
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... |