# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
309969 | tjdgus4384 | Packing Biscuits (IOI20_biscuits) | C++14 | 1091 ms | 384 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;
long long dp[61];
long long count_tastiness(long long x, vector<long long> a){
long long ans = 1, sum = 0;
for(int i = 0;i < a.size();i++) sum += a[i];
for(int i = 1;i <= sum;i++){
long long cnt = sum;
for(int j = a.size();j >= 0;j--){
for(int k = 0;k < a[j];k++){
if((1<<j) <= cnt) cnt -= (1<<j);
else break;
}
}
if(cnt <= 0) ans++;
}
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... |