# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
304829 | 2qbingxuan | Packing Biscuits (IOI20_biscuits) | C++14 | 1098 ms | 768 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>
#ifdef local
#define safe std::cerr<<__PRETTY_FUNCTION__<<" line "<<__LINE__<<" safe\n"
#define debug(...) qqbx(#__VA_ARGS__, __VA_ARGS__)
template <typename H, typename ...T> void qqbx(const char*s, const H &h, T ...args) {
for(; *s && *s != ','; ++s) if(*s != ' ') std::cerr << *s;
std::cerr << " = " << h << (sizeof...(T) ? ", " : "\n");
if constexpr (sizeof...(T)) qqbx(++s, args...);
}
#else
#include "biscuits.h"
#define debug(...) ((void)0)
#define safe ((void)0)
#endif // local
#define pb emplace_back
using namespace std;
typedef long long ll;
const int N = 2500025;
ll count_tastiness(ll x, vector<ll> a) {
int k = a.size();
cerr << x << '\n';
for(int i = 0; i < k; i++) cerr << a[i] << (i+1==k ? '\n' : ' ');
vector<ll> sum(k);
sum[0] = a[0];
for(int i = 1; i < k; i++) sum[i] = sum[i-1] + (a[i] << i);
for(int i = 0; i < k; i++) sum[i] /= x;
/* for(int i = 0; i < k; i++) sum[i] = min(sum[i], ((1LL<<i+1)-1)); */
#if 1
# | 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... |