# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1033527 | 12345678 | Packing Biscuits (IOI20_biscuits) | C++17 | 1076 ms | 1051248 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;
#define ll long long
long long count_tastiness(long long x, std::vector<long long> a) {
ll k=a.size(), p[62];
p[0]=1;
for (int i=1; i<62; i++) p[i]=p[i-1]*2;
vector<ll> cnt(62), qs(62), res, tmp;
for (int i=0; i<a.size(); i++) cnt[i]=a[i];
for (int i=0; i<62; i++) qs[i]=((i==0)?0:qs[i-1])+cnt[i]*p[i];
res.push_back(0);
for (int i=0; i<62; i++)
{
tmp.clear();
if (((double)qs[i])/x<p[i]) break;
for (auto y:res) if (((double)qs[i])/x>=(y+p[i])) tmp.push_back(y+p[i]);
for (auto y:tmp) res.push_back(y);
}
return res.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... |