# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
303629 | 2020-09-20T13:36:59 Z | cgiosy | Packing Biscuits (IOI20_biscuits) | C++17 | 1 ms | 384 KB |
#include "biscuits.h" #include <bits/stdc++.h> using namespace std; using ll=long long; ll count_tastiness(ll x, vector<ll> A) { const int N=A.size(); vector<ll> D(N); for(int i=1; i<N; i++) A[i]=A[i-1]+(A[i]<<i); D[0]=(A[0]>=x)+1; for(int i=1; i<N; i++) { ll v=min(A[i]/x, (ll(1)<<i+1)-1); D[i]+=(v&1)+1; for(int j=1; j<=i; j++) if(v&1<<j) D[i]+=D[j-1]; } return D[N-1]; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 256 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 256 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 256 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 384 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 256 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |