# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
436313 | frodakcin | Packing Biscuits (IOI20_biscuits) | C++17 | 171 ms | 1328 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 <cstdio>
using ll = long long;
ll x;
std::vector<ll> a;
bool test(ll v) // O(K)
{
ll n=0;
for(int i=0;v;v>>=1, n>>=1, ++i)
{
if(i<(int)a.size()) n+=a[i];
if(v&1)
if((n-=x)<0)
return 0;
}
return 1;
}
ll get(int b) // O(K^2) -- max, with b'th bit turned on
{
ll v=1ll<<b;
for(int i=b-1;i>=0;--i)
if(test(v|1ll<<i))
v|=1ll<<i;
return v;
}
# | 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... |