# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
304065 | 2qbingxuan | Packing Biscuits (IOI20_biscuits) | C++14 | 0 ms | 0 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>
#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
#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;
bool check(ll y, ll x, vector<ll> a) {
ll sum = 0;
for(int i = 0; i < k; i++) {
sum += a[i];
if(sum < x * (y & ((1<<i+1)-1)) return false;
}
return true;
}
ll count_tastiness(ll x, vector<ll> a) {
int k = a.size();
ll sum = 0;
for(int i = 0; i < k; i++) sum += a[i];
ll ans = 0;
for(int y = 0; y <= sum / x; y++) {
if(check(y, x, a)) ++ans;
}
return ans;
}