| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1356903 | opeleklanos | Packing Biscuits (IOI20_biscuits) | C++20 | 118 ms | 484 KiB |
#include <iostream>
#include <vector>
using namespace std;
#define ll long long
ll count_tastiness(ll x, vector<ll> a){
if(x>100000) return 1;
ll ans = 0;
for(ll i = 0; i<100000; i++){
vector<ll> t(64, 0);
for(int j = 0; j<a.size(); j++) t[j] = a[j];
ll isAns = 1;
for(ll j = 0; j<t.size()-1; j++){
if(((ll)((ll)1<<(ll)j)) & i){
if(t[j] < x){
isAns = 0;
break;
}
t[j] -= x;
}
t[j+1] += t[j]/2;
}
ans += isAns;
}
return ans;
}| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
