# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
800584 | FEDIKUS | Packing Biscuits (IOI20_biscuits) | C++17 | 1066 ms | 23900 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){
map<ll,ll> da;
da[0]=1;
for(int i=0;i<60;i++) a.push_back(0);
for(int i=0;i<a.size();i++){
map<ll,ll> nov;
for(auto j:da){
nov[(j.first+a[i])/2]+=j.second;
if(j.first+a[i]>=x) nov[(j.first+a[i]-x)/2]+=j.second;
}
da=nov;
}
ll ret=0;
for(auto i:da) ret+=i.second;
return ret;
}
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... |