# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1017016 | dimashhh | Packing Biscuits (IOI20_biscuits) | C++17 | 1060 ms | 4184 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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e6 + 1;
int ok[N];
int n,timer = 0;
int hsb(ll x)
{
for(int i = 60;i >= 0;i--){
if((x >> i) & 1){
return i;
}
}
return -1;
}
ll s[N];
int b = 19;
ll count_tastiness(ll x, vector<ll> a){
++timer;
n = (int)a.size();
for(int i = 0;i <= b;i++){
s[i] = 0;
}
for(int i = 0;i < n;i++){
s[i] = (1ll << i) * 1ll * a[i];
}
for(int i =1;i <= b;i++){
s[i] += s[i - 1];
}
ok[0] = timer;
# | 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... |