# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
693278 | NemanjaSo2005 | Packing Biscuits (IOI20_biscuits) | C++14 | 1084 ms | 340 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>
#define ll long long
using namespace std;
ll kol[65],stepen[65],treba[65],tmp[65],K,X;
string A;
string ubin(int x){
string ret="";
while(x){
if(x%2==1)
ret.push_back(1);
else
ret.push_back(0);
x/=2;
}
//reverse(ret.begin(),ret.end());
return ret;
}
bool mozeli(int koji){
A=ubin(koji);
int N=A.size();
for(int i=0;i<A.size();i++)
treba[i+1]=A[i]*X;
for(int i=1;i<=N;i++)
tmp[i]=kol[i];
for(int i=1;i<=N;i++){
if(treba[i]>tmp[i])
return false;
tmp[i]-=treba[i];
tmp[i+1]+=tmp[i]/2;
}
return true;
}
ll count_tastiness(ll x,vector<ll> a){
K=a.size();
X=x;
for(int i=1;i<=K;i++)
kol[i]=a[i-1];
stepen[1]=1;
for(int i=2;i<=K;i++)
stepen[i]=stepen[i-1]*2;
ll res=0;
for(int i=0;i<=100000;i++){
res+=mozeli(i);
}
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... |