# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
314872 | kostia244 | Packing Biscuits (IOI20_biscuits) | C++17 | 500 ms | 760 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>
#define all(x) begin(x), end(x)
using namespace std;
using ll = long long;
const int B = 126;
vector<ll> convert(__int128 x) {
vector<ll> a(B);
for(int i = 0; i < B; i++) a[i] += x&1, x/=2;
return a;
}
ll count_tastiness(ll x, vector<ll> a) {
__int128 k = 0;
a.resize(B);
vector<vector<ll>> con;
for(int i = 0; i < B; i++) {
k += __int128(a[i])<<i;
if((k/x) < (__int128(2)<<i))
con.push_back(convert(k/x));
}
for(auto &i : con) reverse(all(i));
ll dp[128][128];
memset(dp, 0, sizeof dp);
dp[0][con.size()] = 1;
for(int i = 0; i < B; i++) {
for(int j = 0; j <= con.size(); j++) {
//if(dp[i][j]) cout << i << " " << j << " " << dp[i][j] << endl;
int tj = j;
while(tj && con[tj-1][i] == 1) tj--;
dp[i+1][tj] += dp[i][j];//place 0
int can1 = 1;
for(int k = B-i-1; k < j; k++) can1 &= con[k][i] == 1;
if(can1) dp[i+1][j] += dp[i][j];
}
}
ll ans = 0;
for(int i = 0; i <= con.size(); i++) ans += dp[B][i];
return ans;
}
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... |