# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
955589 | Trisanu_Das | Packing Biscuits (IOI20_biscuits) | C++17 | 1065 ms | 24068 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;
long long count_tastiness(long long x, vector<long long> a){
map<long long, long long> da;
da[0] = 1;
for(int i = 0; i < 60; i++) a.push_back(0);
for(int i = 0; i < a.size(); i++){
map<long long, long long> 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;
}
long long ans = 0;
for(auto i : da) ans += i.second;
return ans;
}
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... |