# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1031245 | happy_node | Packing Biscuits (IOI20_biscuits) | C++17 | 1074 ms | 5100 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;
typedef long long ll;
long long count_tastiness(long long X, std::vector<long long> a) {
while(a.size()<60) a.push_back(0);
int K=a.size();
vector<ll> good; // set of good y's
good.push_back(0);
ll sum=0;
for(int b=0;b<60;b++) {
sum+=a[b]*(1LL<<b);
int s=good.size();
if(s>200'000) break;
for(int i=0;i<s;i++) {
ll y=good[i]+(1LL<<b);
if(y<=sum/X) {
good.push_back(y);
} else {
break;
}
}
}
return good.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... |