# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
672780 | tbzard | Packing Biscuits (IOI20_biscuits) | C++14 | 1101 ms | 216468 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;
set<long double> ans;
long long count_tastiness(long long x, vector<long long> a){
int n = a.size();
ans.clear();
long double b = 1, sum = 0;
ans.insert(0);
for(int i=0;i<a.size();i++){
sum += b*a[i];
vector<long double> add;
while(1){
for(auto y:ans){
if(sum/x >= y+b){
ans.insert(y+b);
}
}
for(int j=0;j<add.size();j++){
ans.insert(add[j]);
}
if(add.empty()) break;
}
b *= 2;
}
return (long long)ans.size();
}
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... |