# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
585788 | LucaIlie | Packing Biscuits (IOI20_biscuits) | C++17 | 1088 ms | 26036 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 MAX_K 60
using namespace std;
long long count_tastiness( long long x, vector <long long> a ) {
int k;
long long s, m;
unordered_map <long, long long> dp[MAX_K];
k = 0;
s = 0;
for ( int b = 0; b < a.size() || s > 0; b++ ) {
if ( b >= a.size() )
a.push_back( 0 );
a[b] += s;
if ( a[b] > x ) {
s = a[b] - x;
a[b] = x + s % 2;
s /= 2;
} else
s = 0;
k++;
}
dp[0][a[0]] = 1;
if ( a[0] - x >= 0 )
dp[0][a[0] - x] = 1;
for ( int b = 1; b < k; b++ ) {
for ( auto p: dp[b - 1] ) {
s = p.first;
m = p.second;
dp[b][s / 2 + a[b]] += m;
if ( s / 2 + a[b] - x >= 0 )
dp[b][s / 2 + a[b] - x] += m;
}
}
m = 0;
for ( auto p: dp[k - 1] )
m += p.second;
return m;
}
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... |