# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
433016 | lior5654 | Packing Biscuits (IOI20_biscuits) | C++17 | 1 ms | 332 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;
typedef long long int ll;
typedef pair<ll, ll> pl;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pl> vpl;
typedef vector<vpl> vvpl;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pi> vpi;
typedef vector<vpi> vvpi;
#define rep(i, n) for(int i = 0; i < n; ++i)
#define all(c) (c.begin()), (c.end())
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
const int maxk = 61;
ll x; int k; ll a[maxk] = { 0 };
void init_input(ll X, const vl& A) {
x = X; k = A.size(); rep(i, k) {a[i] = A[i];}
}
ll count_tastiness(ll X, vl A) {
init_input(X, A);
ll res = 1;
ll num_blocks = a[0] + 1;
ll block_val = 1;
ll dist = 1;
ll mx = num_blocks - 1;
for(int i = 1; i < k; ++i) {
if(!a[i]) continue;
if(mx < 1<<i) {
block_val = num_blocks * block_val;
num_blocks = a[i]+1;
dist = 1<<i;
} else {
num_blocks += (a[i] * (1<<i) / dist);
}
mx += a[i] * (1<<i);
}
return num_blocks * block_val;
}
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... |