# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
996352 | Essa2006 | Packing Biscuits (IOI20_biscuits) | C++14 | 45 ms | 440 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 ll long long
#define endl '\n'
#define FF first
#define SS second
#define all(a) a.begin(), aa.end()
#define mod (ll)(1000000007)
ll count_tastiness(ll n, vector<ll> Freq) {
if (n == 1) {
ll ans = 1;
ll cur = 1, strt = 0;
while (Freq.size() < 61) {
Freq.push_back(0);
}
for (int j = 0; j < 61; j++) {
if (Freq[j] & 1) {
cur += (1 << (j - strt));
}
ll move = Freq[j] / 2;
if (move == 0) {
ans *= cur;
cur = 1;
strt = j + 1;
}
if (j != Freq.size() - 1)
Freq[j + 1] += move;
}
ans *= cur;
return ans;
}
int sum = 100000 / n;
int ans = 0;
for (int i = 0; i <= sum; i++) {
vector<ll> Freq2 = Freq;
while(Freq2.size() < 18) {
Freq2.push_back(0);
}
int j = 0;
bool cant = 0;
while (j < 18) {
if ((1 << j) & i) {
if (Freq2[j] < n) {
cant = 1;
break;
}
Freq2[j] -= n;
}
if (j != Freq2.size() - 1) {
Freq2[j + 1] += Freq2[j] / 2;
}
j++;
}
ans += !cant;
}
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... |