# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1079009 | anango | Packing Biscuits (IOI20_biscuits) | C++17 | 1014 ms | 352 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>
#define int long long
using namespace std;
const int JFF = 300000;
long long count_tastiness(long long x, std::vector<long long> a) {
int n = a.size();
int ct = 0;
int ava = 0;
while (a.size()<60) {
a.push_back(0);
}
for (int k=0; k<JFF; k++) {
int fail = 0;
for (int i=0; i<60; i++) {
ava+=a[i];
if (k&(1LL<<i)) {
ava-=x;
}
if (ava<0) {
fail=1;
break;
}
ava/=2;
}
ct+=1-fail;
if (!fail) {
}
}
return ct;
}
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... |