# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
333320 | nickmet2004 | Packing Biscuits (IOI20_biscuits) | C++14 | 2 ms | 620 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<bits/stdc++.h>
#include "biscuits.h"
#define ll long long
using namespace std;
ll X;
ll dp[61] , Pr[61];
ll Q(ll a){
if(a < 0ll)return 0;
if(!a) return 1;
int j;
for(int j = 60; ~j; --j) if((1ll << j) <= a)break;
return dp[j] + Q(min(a , Pr[j] / X) - (1ll << j));
}
ll count_tastiness(ll X , vector<ll> a){
int n = a.size(); X = X;
for(int i = 0; i < n; ++i) if(i)Pr[i] = Pr[i - 1] + a[i] * (1ll << i);
dp[0] = 1;
/// 2^k___2^(k+1) - 1
/// dp[k + 1] = dp[k] + a;
for(int k = 1; k < 61; ++k) dp[k] = Q((1ll << k) - 1);
return dp[60];
}
//int main (){}
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... |