| # | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 303701 | 2020-09-20T14:44:46 Z | junseo | Packing Biscuits (IOI20_biscuits) | C++17 | 0 ms | 0 KB |
#include "biscuits.h"
#include <bits/stdc++.h>
#define fi first
#define se second
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
#define rmin(r, x) r = min(r, x)
#define rmax(r, x) r = max(r, x)
#define ends ' '
#define endl '\n'
#define fastio ios_base::sync_with_stdio(0), cin.tie(0)
#pragma GCC optimize("O3")
#pragma GCC target("avx,avx2")
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int maxk = 65;
int k;
ll s[maxk];
inline long long count_tastiness(long long x, std::vector<long long> a) {
k = a.size();
a.resize(maxk);
s[0] = a[0];
for(int i = 1; i <= 60; ++i) s[i] = s[i - 1] + (1LL << i) * a[i];
vector<ll> ans;
ans.eb(0);
for(int i = 0; (1LL << i) <= s[60] && i <= 60; ++i) {
int st = 0, ed = ans.size() - 1, r = -1;
while(st <= ed) {
int mid = st + ed >> 1;
if(s[i] / x >= (ans[mid] + (1LL << i))) {
r = mid;
st = mid + 1;
}
else ed = mid - 1;
}
for(int j = 0; j <= r; ++j) {
ans.eb(ans[j] + (1LL << i));
}
}
assert(ans.size() <= 2e5);
return ans.size();
}