# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
303395 | 2020-09-20T09:35:31 Z | qiangbao | Packing Biscuits (IOI20_biscuits) | C++14 | 9 ms | 384 KB |
#include <iostream> #include <vector> //#include "biscuits.h" using namespace std; typedef long long ll; ll ways[64]; ll pow2[64]; void ini() { ll i; pow2[0]=1; for(i=1;i<=63;i++) pow2[i]=pow2[i-1]*2; for(i=0;i<=63;i++) ways[i]=0; ways[0]=1; } ll count_tastiness(ll x, vector<ll> a) { ll tot=0; ll i, j; a.resize(64); ini(); for(i=0;i<=63;i++){ ll way=0; tot+=a[i]*pow2[i]; ll tot2=tot; for(j=i;j>=0;j--) if(tot2>=x*pow2[j]) tot2-=x*pow2[j], way+=ways[j]; ways[i+1]=way+1; } return ways[63]; } //int main() //{ // cout << count_tastiness(1, {2}) << endl; //}
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 | 9 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 | - |