# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1080325 | UmairAhmadMirza | Packing Biscuits (IOI20_biscuits) | C++17 | 1 ms | 348 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 <bits/stdc++.h>
using namespace std;
#define int long long
int const K=60;
int cnt[K];
long long count_tastiness(long long x, vector<long long> a){
for(int i=0;i<K;i++)
cnt[i]=0;
for(int i=0;i<a.size();i++)
cnt[i]=a[i];
for(int i=0;i<K-1;i++){
if(cnt[i]>1){
cnt[i+1]+=(cnt[i]-1)/2;
cnt[i]=1;
}
}
int one=0;
for(int i=0;i<K-1;i++)
if(cnt[i])
one++;
int ans=1;
ans=ans<<one;
ans*=(cnt[K-1]+1);
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... |