# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
796963 | vjudge1 | Packing Biscuits (IOI20_biscuits) | C++17 | 1069 ms | 340 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<algorithm>
long long count_tastiness(long long x, std::vector<long long> a){
int ans = 0, sum = 0;
for(int i = 0; i < a.size(); i++) {
sum+=a[i]<<i;
}
if(x>sum) return 1;
for(int y = 0; y <= sum/x; y++) {
std::vector<long long> a2 = a;
for(int i = 0; i < x; i++) {
long long rem=y;
for(int j = a.size(); j--;) {
int need = std::min(a2[j], rem>>j);
rem-=need<<j;
a2[j]-=need;
}
if(rem)
break;
if(i==x-1)
ans++;
}
}
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... |