# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
376566 | Jarif_Rahman | Packing Biscuits (IOI20_biscuits) | C++17 | 1153 ms | 762620 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 pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef string str;
const int kk = 60;
ll count_tastiness(ll x, vector<ll> aa){
vector<ld> a(kk);
int k = aa.size();
for(int i = 0; i < k; i++) a[i] = aa[i];
ll ans = 0;
vector<ld> s(kk, 0);
for(int i = 0; i < kk; i++){
if(i != 0) s[i] = s[i-1];
s[i]+=(a[i]/x)*(1LL<<i);
}
vector<ld> v;
v.pb({0});
for(int i = 0; i < kk; i++){
ld mx = s[i]; ll p = 1;
p<<=i;
mx-=(ld)p;
int in = upper_bound(v.begin(), v.end(), mx) - v.begin();
for(int j = 0; j < in; j++) v.pb(v[j]+p);
}
return v.size();
}
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... |