# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
613367 | penguinhacker | Packing Biscuits (IOI20_biscuits) | C++17 | 1070 ms | 15756 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;
#define ll long long
#define ar array
ll count_tastiness(ll x, vector<ll> a) {
map<ll, ll> dp;
dp[0]=1;
for (int i=0; i<a.size()||dp.size()>1; ++i) {
map<ll, ll> dp2;
for (auto b : dp) {
ll cur=b.first+(i<a.size()?a[i]:0);
dp2[cur/2]+=b.second;
if (cur>=x)
dp2[(cur-x)/2]+=b.second;
}
swap(dp, dp2);
}
return dp[0];
}
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... |