| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1351917 | MuhammadSaram | Packing Biscuits (IOI20_biscuits) | C++20 | 32 ms | 428 KiB |
#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
long long count_tastiness(long long x, vector<long long> a1)
{
int m=100000, k=a1.size(), ans=0;k=min(k,20);
for (int i=1;i*x<=m;i++)
{
vector<ll> a=a1;
bool pos=1;
for (int ct=0;ct<x;ct++)
{
int val=i;
for (int j=k-1;j>=0;j--)
{
if ((1<<j)<=val)
{
int o=min(a[j],(ll)val/(1<<j));
val-=o*(1<<j), a[j]-=o;
}
}
if (val) pos=0;
}
ans+=pos;
}
return ans;
}| # | 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... | ||||
