| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1035296 | Zicrus | Packing Biscuits (IOI20_biscuits) | C++17 | 1091 ms | 1176 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>
#include "biscuits.h"
using namespace std;
typedef long long ll;
ll numCalls;
ll numWays(const ll &n, const ll &m, const ll &mxN, const ll &x, const vector<ll> &a) {
if (n == mxN) return m/x + 1;
ll res = numWays(n+1, a[n+1] + m/2, mxN, x, a);
if (m >= x) {
res += numWays(n+1, a[n+1] + (m-x)/2, mxN, x, a);
}
return res;
}
ll count_tastiness(ll x, vector<ll> a) {
numCalls = 0;
for (int i = 0; i < a.size(); i++) {
ll transfer = max(0ll, (a[i]-x) / (2*x));
if (transfer > 0) {
if (i+1 >= a.size()) a.push_back(x*transfer);
else a[i+1] += x*transfer;
a[i] -= 2*x*transfer;
}
}
ll n = a.size();
ll res = numWays(0, a[0], n-1, x, a);
return res;
}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... | ||||
