# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
519643 | DanerZein | Packing Biscuits (IOI20_biscuits) | C++14 | 1087 ms | 308 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_N=1e5;
int bits[62];
long long count_tastiness(long long x, std::vector<long long> a) {
ll res=0;
for(ll i=0;i<=MAX_N;i++){
memset(bits,0,sizeof bits);
for(int j=0;j<a.size();j++) bits[j]=a[j];
bool sw=1;
for(ll j=0;j<30;j++){
if(i&(1<<j)){
if(bits[j]<x){
sw=0;
break;
}
bits[j]-=x;
}
bits[j+1]+=(bits[j]/2);
}
res+=sw;
}
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... |