# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
332193 | pggp | Packing Biscuits (IOI20_biscuits) | C++14 | 1111 ms | 257260 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>
using namespace std;
long long count_tastiness(long long x, vector < long long > k){
k.resize(62);
for (long long i = 0; i < k.size() - 1; ++i)
{
if(k[i] > x){
k[i + 1] += (k[i] - x)/2;
k[i] -= 2 * ((k[i] - x)/2);
}
//cout << "k: " << k[i] << endl;
}
long long DP[2 * x + 2];
long long DP1[2 * x + 2];
for (long long j = 0; j < 2 * x + 2; ++j)
{
DP[j] = DP1[j] = 0;
}
DP[k[0]] = 1;
for (long long i = 0; i < k.size() - 1; ++i)
{
// używamy x
for (long long j = 0; j < 2 * x + 2 and k[i + 1] + (j - x) / 2 < 2 * x + 2; ++j)
{
if(j >= x){
DP1[k[i + 1] + (j - x) / 2] += DP[j];
}
}
// nie używamy x
for (long long j = 0; j < 2 * x + 2 and k[i + 1] + j / 2 < 2 * x + 2; ++j)
{
DP1[k[i + 1] + j / 2] += DP[j];
}
for (long long j = 0; j < 2 * x + 2; ++j)
{
//cout << DP1[j] << " ";
}
for (long long j = 0; j < 2 * x + 2; ++j)
{
DP[j] = DP1[j];
DP1[j] = 0;
}
//cout << endl;
}
long long sum = 0;
for (long long i = 0; i < 2 * x + 1; ++i)
{
sum += DP[i];
}
return sum;
}
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... |