# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
303626 | cgiosy | Packing Biscuits (IOI20_biscuits) | C++17 | 2 ms | 384 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;
using ll=long long;
ll count_tastiness(ll x, vector<ll> A) {
const int N=A.size();
vector<ll> D(N);
for(int i=1; i<N; i++) A[i]=A[i-1]+(A[i]<<i);
D[0]=(A[0]>=x)+1;
for(int i=1; i<N; i++) {
D[i]=D[i-1];
ll v=min(A[i]/x, (ll(1)<<i+1)-1);
if(!(v&ll(1)<<i)) continue;
D[i]+=(v&1)+1;
for(int j=1; j<i; j++) if(v&1<<j) D[i]+=D[j-1];
}
return D[N-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... |