# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1059168 | mychecksedad | Packing Biscuits (IOI20_biscuits) | C++17 | 5 ms | 600 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 pb push_back
#define ll long long int
#define all(x) x.begin(),x.end()
#define vi vector<int>
#define pii pair<int,int>
#define ff first
#define ss second
#define ll __int128_t
long long count_tastiness(long long x, std::vector<long long> B) { vector<ll> a(all(B));
// if(x > 1000000) return 1;
int k = 63;
a.resize(k);
vector<vector<pair<ll, ll>>> dp(k);
for(int i = 0; i + 1 < a.size(); ++i){
if(a[i] > x){
ll dif = (a[i] - x) / 2;
a[i + 1] += dif;
a[i] -= dif * 2;
}
}
vector<ll> g(k);
// k=63;
g[0] = (a[0] >= x ? 2 : 1);
// for(int i = 0; i < k; ++i) cout << a[i] << ' ';
// cout << '\n';
for(int i = 1; i < k; ++i){
if(a[i] >= x){
g[i] = g[i - 1] * 2;
}else{
g[i] = g[i - 1];
ll sum = a[i] * 2, req = 2 * x;
for(int j = i - 1; j >= 0; --j){
ll add = min(a[j], req - sum);
sum += add;
// cout << j << ' ' << req << ' ' << sum << '\n';
// cout << sum << ' ';
if(sum >= req){
g[i] += (j == 0 ? 1ll : g[j - 1]);
sum -= req;
req = x;
}
sum *= 2;
req *= 2;
}
}
// cout << g[i] << '\n';
}
return g.back();
}
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... |