| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1247216 | nikulid | Packing Biscuits (IOI20_biscuits) | C++20 | 1 ms | 328 KiB |
#include <iostream>
#include "biscuits.h"
#include <vector>
using namespace std;
#define ll long long
ll count_tastiness(ll x, vector<ll> a) {
for(int i=0; i<a.size()-1; i++){
if(a[i] > 2){
a[i+1] += (a[i]-1)/2;
a[i] = ((a[i]-1)%2)+1;
}
}
ll answer = a[a.size()-1]+1;
for(int i=a.size()-2; i>-1; i--){
if(a[i]==0)continue;
answer *= 2;
answer += (a[i]-1);
}
return answer;
}
| # | 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... | ||||
