| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1270233 | AlgorithmWarrior | Packing Biscuits (IOI20_biscuits) | C++20 | 1096 ms | 836 KiB |
///#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;
long long count_tastiness(long long x,vector<long long>a){
long long y;
int cnt=0;
long long sum=0;
int i;
int k=a.size();
for(i=0;i<k;++i)
sum+=a[i]*(1LL<<i);
for(y=0;x*y<=sum;++y){
long long avem=0;
bool ok=1;
for(i=0;i<k;++i){
avem+=a[i];
if(y&(1LL<<i)){
if(avem<x)
ok=0;
else
avem-=x;
}
avem/=2;
}
cnt+=ok;
}
return cnt;
}| # | 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... | ||||
