# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1055568 | Trent | Packing Biscuits (IOI20_biscuits) | C++17 | 60 ms | 1156 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"
using namespace std;
#define forR(i, x) for(int i = 0; i < (x); ++i)
#define REP(i, a, b) for(int i = (a); i < (b); ++i)
#define all(x) x.begin(), x.end()
typedef long long ll;
typedef vector<ll> vll;
ll INF = 1e18 + 10;
ll mult(ll a, ll b) {
return a > INF / b ? INF : a * b;
}
ll valOf(ll msk, vll& dc) {
ll ret = 0;
forR(i, dc.size()) if(msk & (1LL << i)) ret = min(INF, ret + dc[dc.size() - 1 - i]);
return ret;
}
long long count_tastiness(long long x, std::vector<long long> a) {
a.insert(a.begin(), (ll) 0);
int k = 60;
while(a.size() < k) a.push_back(0);
vll ftp(k);
vll sm(k);
sm[0] = a[0];
REP(i, 1, k) sm[i] = sm[i-1] + (1LL << (i-1)) * a[i];
forR(i, k) {
if(i == 0) ftp[i] = 1;
else {
ll st = sm[i];
vll dc = {mult(1LL << (i-1), x)};
ll msk = 0;
for(int j = i-1; j >= 0; --j) {
// st - dc(lo) >= sm[j], st - dc(hi) < sm[j]
if(st - valOf(msk, dc) >= sm[j]) {
ll lo=msk, hi=(1LL << dc.size());
assert(hi > lo);
while(hi - lo > 1) {
ll mid = (lo+hi)/2;
if(st - valOf(mid, dc) >= sm[j]) lo = mid;
else hi = mid;
}
ftp[i] += (hi - msk) * ftp[j];
if(hi == (1LL << dc.size())) break;
msk = hi << 1;
dc.push_back((1LL << (j-1)) * x);
} else {
msk <<= 1;
dc.push_back((1LL << (j-1)) * x);
}
}
}
}
return ftp[k-1];
}
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... |