# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
429340 | DanerZein | Packing Biscuits (IOI20_biscuits) | C++14 | 1070 ms | 332 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 "biscuits.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAX_Y=1e5;
long long count_tastiness(long long x, std::vector<long long> a) {
ll res=0;
ll bis[61];
for(int y=0;y<=MAX_Y;y++){
memset(bis,0,sizeof bis);
for(int j=0;j<a.size();j++) bis[j]=a[j];
bool sw=0;
for(int j=0;j<=20;j++){
ll ne;
if(y&(1<<j)){
ne=x;
if(bis[j]<x){
sw=1;
break;
}
}
else{
ne=0;
}
bis[j+1]+=((bis[j]-ne)/2);
}
if(!sw) res++;
}
return res;
}
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... |