| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1079962 | Muhammad_Aneeq | 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 <vector>
using namespace std;
long long count_tastiness(long long x, vector<long long> a)
{
if (x==1)
{
int n=a.size();
long long ans=1;
int cons=0;
for (int i=0;i<n;i++)
{
if (a[i]==0)
cons++;
else
{
ans+=(1ll<<(i-cons))*a[i];
cons=0;
}
}
return ans;
}
return 0;
}
| # | 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... | ||||
